/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:01:56,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:01:56,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:01:56,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:01:56,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:01:56,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:01:56,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:01:56,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:01:56,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:01:56,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:01:56,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:01:56,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:01:56,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:01:56,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:01:56,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:01:56,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:01:56,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:01:56,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:01:56,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:01:56,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:01:56,681 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:01:56,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:01:56,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:01:56,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:01:56,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:01:56,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:01:56,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:01:56,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:01:56,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:01:56,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:01:56,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:01:56,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:01:56,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:01:56,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:01:56,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:01:56,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:01:56,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:01:56,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:01:56,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:01:56,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:01:56,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:01:56,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:01:56,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:01:56,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:01:56,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:01:56,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:01:56,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:01:56,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:01:56,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:01:56,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:01:56,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:01:56,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:01:56,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:01:56,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:01:56,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:01:56,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:01:56,710 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:01:56,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:01:56,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:01:56,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:01:56,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:01:56,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:01:56,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-28 14:01:56,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9600b26fd/4cec9cc0c6ca44ceb675821e706b380f/FLAG0032c0c1d [2022-04-28 14:01:57,292 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:01:57,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-28 14:01:57,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9600b26fd/4cec9cc0c6ca44ceb675821e706b380f/FLAG0032c0c1d [2022-04-28 14:01:57,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9600b26fd/4cec9cc0c6ca44ceb675821e706b380f [2022-04-28 14:01:57,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:01:57,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:01:57,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:01:57,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:01:57,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:01:57,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352b2ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57, skipping insertion in model container [2022-04-28 14:01:57,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:01:57,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:01:57,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c[524,537] [2022-04-28 14:01:57,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:01:57,466 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:01:57,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c[524,537] [2022-04-28 14:01:57,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:01:57,488 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:01:57,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57 WrapperNode [2022-04-28 14:01:57,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:01:57,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:01:57,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:01:57,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:01:57,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:01:57,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:01:57,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:01:57,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:01:57,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (1/1) ... [2022-04-28 14:01:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:01:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:57,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:01:57,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:01:57,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:01:57,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:01:57,578 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:01:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:01:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:01:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:01:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:01:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:01:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:01:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:01:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:01:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:01:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:01:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:01:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:01:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:01:57,625 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:01:57,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:01:57,822 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:01:57,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:01:57,828 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:01:57,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:01:57 BoogieIcfgContainer [2022-04-28 14:01:57,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:01:57,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:01:57,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:01:57,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:01:57,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:01:57" (1/3) ... [2022-04-28 14:01:57,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d7acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:01:57, skipping insertion in model container [2022-04-28 14:01:57,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:57" (2/3) ... [2022-04-28 14:01:57,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d7acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:01:57, skipping insertion in model container [2022-04-28 14:01:57,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:01:57" (3/3) ... [2022-04-28 14:01:57,837 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.c [2022-04-28 14:01:57,846 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:01:57,847 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:01:57,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:01:57,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32164e52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6600761d [2022-04-28 14:01:57,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:01:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:01:57,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:57,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:57,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-28 14:01:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:57,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558480344] [2022-04-28 14:01:57,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:01:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-28 14:01:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:57,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048664380] [2022-04-28 14:01:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:01:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-28 14:01:58,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 14:01:58,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 14:01:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:01:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 14:01:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:01:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 14:01:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 14:01:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 14:01:58,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:01:58,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-28 14:01:58,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 14:01:58,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 14:01:58,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-28 14:01:58,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-28 14:01:58,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-28 14:01:58,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 14:01:58,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-28 14:01:58,073 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-28 14:01:58,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,074 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 14:01:58,074 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-28 14:01:58,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:01:58,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:01:58,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:01:58,075 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 14:01:58,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-28 14:01:58,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-28 14:01:58,077 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-28 14:01:58,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 14:01:58,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 14:01:58,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 14:01:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:01:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:58,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048664380] [2022-04-28 14:01:58,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048664380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:58,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:58,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:01:58,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558480344] [2022-04-28 14:01:58,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558480344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:58,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:58,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:01:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264267428] [2022-04-28 14:01:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 14:01:58,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:58,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:01:58,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:58,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:01:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:01:58,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:01:58,143 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:01:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:58,290 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-28 14:01:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:01:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 14:01:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:01:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 14:01:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:01:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 14:01:58,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-28 14:01:58,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:58,428 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:01:58,428 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 14:01:58,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:01:58,435 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:58,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:01:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 14:01:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 14:01:58,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:58,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:01:58,459 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:01:58,459 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:01:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:58,464 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 14:01:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:01:58,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:58,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:58,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 14:01:58,465 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 14:01:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:58,470 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 14:01:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:01:58,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:58,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:58,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:58,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:01:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-28 14:01:58,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-28 14:01:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:58,477 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-28 14:01:58,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:01:58,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-28 14:01:58,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:01:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:01:58,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:58,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:58,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:01:58,512 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-28 14:01:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:58,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [631848010] [2022-04-28 14:01:58,514 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:01:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-28 14:01:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:58,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667068021] [2022-04-28 14:01:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:58,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404102604] [2022-04-28 14:01:58,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:58,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:58,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:01:58,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:01:58,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:58,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:01:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:58,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:58,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-28 14:01:58,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-28 14:01:58,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:01:58,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-28 14:01:58,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-28 14:01:58,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {295#true} is VALID [2022-04-28 14:01:58,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {295#true} is VALID [2022-04-28 14:01:58,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:01:58,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:01:58,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:01:58,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-28 14:01:58,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-28 14:01:58,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {295#true} is VALID [2022-04-28 14:01:58,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:01:58,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:01:58,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:01:58,797 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-28 14:01:58,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-28 14:01:58,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:01:58,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:01:58,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:01:58,798 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-28 14:01:58,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:58,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:58,800 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:58,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:58,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-28 14:01:58,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-28 14:01:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:01:58,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:01:58,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:58,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667068021] [2022-04-28 14:01:58,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:58,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404102604] [2022-04-28 14:01:58,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404102604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:58,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:58,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:01:58,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:58,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [631848010] [2022-04-28 14:01:58,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [631848010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:58,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:01:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273905012] [2022-04-28 14:01:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 14:01:58,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:58,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:01:58,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:01:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:01:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:01:58,822 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:01:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:58,993 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 14:01:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:01:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 14:01:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:01:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 14:01:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:01:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 14:01:58,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 14:01:59,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:59,057 INFO L225 Difference]: With dead ends: 43 [2022-04-28 14:01:59,058 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:01:59,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:01:59,062 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:59,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:01:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:01:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-28 14:01:59,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:59,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:01:59,085 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:01:59,086 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:01:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:59,089 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 14:01:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 14:01:59,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:59,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:59,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 14:01:59,091 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 14:01:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:59,096 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 14:01:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 14:01:59,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:59,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:59,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:59,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:01:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-28 14:01:59,104 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-28 14:01:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:59,104 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-28 14:01:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:01:59,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-28 14:01:59,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 14:01:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:01:59,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:59,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:59,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:01:59,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:59,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-28 14:01:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:59,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094717165] [2022-04-28 14:01:59,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:01:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-28 14:01:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:59,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298921507] [2022-04-28 14:01:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:59,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621331570] [2022-04-28 14:01:59,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:59,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:59,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:59,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:01:59,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:59,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:59,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:01:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:59,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:10,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 14:02:10,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-28 14:02:10,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:10,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 14:02:10,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 14:02:10,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-28 14:02:10,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:10,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:10,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:10,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:10,108 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:10,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:02:10,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:02:10,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:10,110 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:10,110 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:10,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:10,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:10,112 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {694#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:02:10,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:02:10,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:02:10,113 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:10,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:10,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:10,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:12,117 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= main_~x~0 10) (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 14:02:12,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= main_~x~0 10) (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:02:12,119 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:12,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:12,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 14:02:12,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 14:02:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:02:12,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:45,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 14:02:45,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 14:02:45,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:45,366 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:45,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:45,368 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:02:45,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:45,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:45,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:02:45,369 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:45,370 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-28 14:02:45,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:02:45,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-28 14:02:45,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-28 14:02:45,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 14:02:45,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 14:02:45,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:02:45,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-28 14:02:45,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 14:02:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:02:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298921507] [2022-04-28 14:02:45,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621331570] [2022-04-28 14:02:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621331570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:02:45,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:02:45,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 14:02:45,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094717165] [2022-04-28 14:02:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094717165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:45,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:45,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:02:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965506138] [2022-04-28 14:02:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 14:02:45,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:45,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:02:47,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:47,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:02:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:02:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:02:47,400 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:02:49,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:02:53,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:02:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:53,456 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 14:02:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:02:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 14:02:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:02:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 14:02:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:02:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 14:02:53,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-28 14:02:53,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:53,505 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:02:53,505 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:02:53,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:02:53,506 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:53,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 14:02:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:02:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-28 14:02:53,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:53,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:53,561 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:53,562 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:53,563 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 14:02:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 14:02:53,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:53,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:53,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 14:02:53,564 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 14:02:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:53,565 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 14:02:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 14:02:53,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:53,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:53,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:53,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-28 14:02:53,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-28 14:02:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:53,568 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-28 14:02:53,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:02:53,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-28 14:02:53,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-28 14:02:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:02:53,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:53,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:02:53,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:02:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 14:02:53,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-28 14:02:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974759485] [2022-04-28 14:02:53,824 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:02:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-28 14:02:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694337338] [2022-04-28 14:02:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:53,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:53,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854133297] [2022-04-28 14:02:53,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:53,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:02:53,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:53,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:53,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 14:02:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:53,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:56,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:02:56,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-28 14:02:56,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:02:56,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 14:02:56,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:02:56,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:02:56,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:02:56,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:56,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:56,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:56,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #71#return; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:56,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:56,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:02:56,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:02:56,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:02:56,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:02:56,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:02:56,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:02:56,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:56,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:56,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:56,877 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {1187#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:02:56,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:56,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:56,878 INFO L272 TraceCheckUtils]: 24: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:02:56,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:02:56,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:02:56,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:02:56,879 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:56,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:56,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:02:56,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} assume !false; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:02:56,884 INFO L272 TraceCheckUtils]: 32: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:56,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:56,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:02:56,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:02:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:02:56,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:03:58,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:03:58,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:03:58,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:58,886 INFO L272 TraceCheckUtils]: 32: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:58,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:58,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:58,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 14:03:58,892 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} #77#return; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 14:03:58,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:03:58,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:03:58,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:03:58,892 INFO L272 TraceCheckUtils]: 24: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:03:58,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !false; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 14:03:58,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 14:03:58,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #75#return; {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 14:03:58,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:03:58,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:03:58,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:03:58,901 INFO L272 TraceCheckUtils]: 17: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:03:58,901 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-28 14:03:58,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:03:58,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:03:58,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:03:58,901 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:03:58,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-28 14:03:58,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:03:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:03:58,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:58,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694337338] [2022-04-28 14:03:58,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:58,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854133297] [2022-04-28 14:03:58,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854133297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:03:58,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:03:58,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 14:03:58,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:58,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974759485] [2022-04-28 14:03:58,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974759485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:58,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:58,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:03:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526221814] [2022-04-28 14:03:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 14:03:58,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:58,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:03:58,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:03:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:03:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:03:58,937 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:03:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:59,799 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 14:03:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:03:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 14:03:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:03:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-28 14:03:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:03:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-28 14:03:59,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-28 14:03:59,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:59,876 INFO L225 Difference]: With dead ends: 59 [2022-04-28 14:03:59,876 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 14:03:59,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:03:59,877 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 125 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:03:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 14:03:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-28 14:03:59,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:59,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:59,933 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:59,934 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:59,936 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 14:03:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-28 14:03:59,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:59,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:59,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-28 14:03:59,936 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-28 14:03:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:59,938 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 14:03:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-28 14:03:59,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:59,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:59,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:59,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:03:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 14:03:59,940 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 36 [2022-04-28 14:03:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:59,940 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 14:03:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:03:59,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 14:04:00,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 14:04:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:04:00,006 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:00,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:00,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:00,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:00,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-28 14:04:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:00,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150560038] [2022-04-28 14:04:00,222 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-28 14:04:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:00,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320998295] [2022-04-28 14:04:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:00,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:00,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666893972] [2022-04-28 14:04:00,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:00,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:00,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:04:00,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:00,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:00,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:04:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:00,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:00,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-28 14:04:00,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-28 14:04:00,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:00,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-28 14:04:00,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-28 14:04:00,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:00,560 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-28 14:04:00,561 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:00,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:00,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:00,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:00,561 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-28 14:04:00,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {1677#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,562 INFO L272 TraceCheckUtils]: 24: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:00,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:00,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {1758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:00,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:00,564 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !false; {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:04:00,574 INFO L272 TraceCheckUtils]: 33: Hoare triple {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:00,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1789#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:00,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {1789#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-28 14:04:00,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-28 14:04:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:00,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:12,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-28 14:04:12,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {1789#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-28 14:04:12,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1789#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:12,971 INFO L272 TraceCheckUtils]: 33: Hoare triple {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:12,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:12,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:12,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 14:04:12,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 14:04:12,990 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} {1677#true} #77#return; {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 14:04:12,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:12,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {1831#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:12,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1831#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:04:12,991 INFO L272 TraceCheckUtils]: 24: Hoare triple {1677#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:12,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {1677#true} assume !false; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {1677#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:12,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-28 14:04:12,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-28 14:04:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320998295] [2022-04-28 14:04:12,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666893972] [2022-04-28 14:04:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666893972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:12,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:12,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 14:04:12,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150560038] [2022-04-28 14:04:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150560038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:12,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:12,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:04:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112236981] [2022-04-28 14:04:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 14:04:12,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:12,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:13,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:13,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:04:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:04:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:04:13,019 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:13,815 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-04-28 14:04:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:04:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 14:04:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-28 14:04:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-28 14:04:13,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-28 14:04:13,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:13,895 INFO L225 Difference]: With dead ends: 77 [2022-04-28 14:04:13,895 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 14:04:13,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:04:13,896 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:13,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 117 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:04:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 14:04:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-04-28 14:04:13,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:13,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:13,971 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:13,971 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:13,973 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-28 14:04:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-04-28 14:04:13,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:13,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:13,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 63 states. [2022-04-28 14:04:13,974 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 63 states. [2022-04-28 14:04:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:13,976 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-28 14:04:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-04-28 14:04:13,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:13,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:13,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:13,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-28 14:04:13,978 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 37 [2022-04-28 14:04:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:13,978 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-28 14:04:13,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:13,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2022-04-28 14:04:14,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-28 14:04:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:04:14,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:14,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:14,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:14,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:14,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-28 14:04:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:14,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1539282399] [2022-04-28 14:04:14,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-28 14:04:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:14,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509725463] [2022-04-28 14:04:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:14,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:14,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242673394] [2022-04-28 14:04:14,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:14,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:04:14,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:14,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:14,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:04:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:14,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:14,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {2311#true} call ULTIMATE.init(); {2311#true} is VALID [2022-04-28 14:04:14,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2311#true} is VALID [2022-04-28 14:04:14,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2311#true} {2311#true} #83#return; {2311#true} is VALID [2022-04-28 14:04:14,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {2311#true} call #t~ret6 := main(); {2311#true} is VALID [2022-04-28 14:04:14,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {2311#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2311#true} is VALID [2022-04-28 14:04:14,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {2311#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#true} ~cond := #in~cond; {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:14,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:14,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:14,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} {2311#true} #71#return; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:14,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:14,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,546 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2311#true} {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:14,546 INFO L272 TraceCheckUtils]: 17: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {2311#true} ~cond := #in~cond; {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:14,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:14,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:14,551 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {2382#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:14,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:14,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:14,552 INFO L272 TraceCheckUtils]: 24: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,553 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2311#true} {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:14,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:14,553 INFO L272 TraceCheckUtils]: 30: Hoare triple {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,554 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2311#true} {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:14,555 INFO L272 TraceCheckUtils]: 35: Hoare triple {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:14,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:14,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2312#false} is VALID [2022-04-28 14:04:14,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2022-04-28 14:04:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 14:04:14,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:14,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2022-04-28 14:04:14,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2312#false} is VALID [2022-04-28 14:04:14,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:14,762 INFO L272 TraceCheckUtils]: 35: Hoare triple {2447#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:14,763 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2311#true} {2447#(= (* main_~b~0 main_~a~0) 0)} #79#return; {2447#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:04:14,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,763 INFO L272 TraceCheckUtils]: 30: Hoare triple {2447#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {2311#true} assume !(0 != ~a~0 && 0 != ~b~0); {2447#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:04:14,765 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2311#true} {2311#true} #77#return; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L272 TraceCheckUtils]: 24: Hoare triple {2311#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {2311#true} assume !false; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {2311#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2311#true} {2311#true} #75#return; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L272 TraceCheckUtils]: 17: Hoare triple {2311#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,765 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2311#true} {2311#true} #73#return; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {2311#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {2311#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2311#true} {2311#true} #71#return; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {2311#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {2311#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2311#true} is VALID [2022-04-28 14:04:14,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {2311#true} call #t~ret6 := main(); {2311#true} is VALID [2022-04-28 14:04:14,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2311#true} {2311#true} #83#return; {2311#true} is VALID [2022-04-28 14:04:14,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-28 14:04:14,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2311#true} is VALID [2022-04-28 14:04:14,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {2311#true} call ULTIMATE.init(); {2311#true} is VALID [2022-04-28 14:04:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 14:04:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509725463] [2022-04-28 14:04:14,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242673394] [2022-04-28 14:04:14,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242673394] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:04:14,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:04:14,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 14:04:14,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1539282399] [2022-04-28 14:04:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1539282399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:14,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:14,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:04:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248165458] [2022-04-28 14:04:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 14:04:14,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:14,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:04:14,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:04:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:04:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:04:14,791 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:04:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:15,175 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-28 14:04:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:04:15,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 14:04:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:04:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:04:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:04:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:04:15,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:04:15,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:15,206 INFO L225 Difference]: With dead ends: 65 [2022-04-28 14:04:15,206 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 14:04:15,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:04:15,207 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:15,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:04:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 14:04:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 14:04:15,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:15,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:15,279 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:15,280 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:15,281 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 14:04:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 14:04:15,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:15,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:15,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 14:04:15,282 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 14:04:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:15,283 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 14:04:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 14:04:15,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:15,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:15,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:15,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2022-04-28 14:04:15,285 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 39 [2022-04-28 14:04:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:15,285 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2022-04-28 14:04:15,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:04:15,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 64 transitions. [2022-04-28 14:04:15,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-28 14:04:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 14:04:15,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:15,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:15,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:15,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:15,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-28 14:04:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:15,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102831059] [2022-04-28 14:04:15,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 2 times [2022-04-28 14:04:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:15,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743765069] [2022-04-28 14:04:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:15,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:15,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127558842] [2022-04-28 14:04:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:15,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:15,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:04:15,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:15,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:15,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:04:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:15,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:16,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-28 14:04:16,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {2899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2899#true} is VALID [2022-04-28 14:04:16,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:16,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #83#return; {2899#true} is VALID [2022-04-28 14:04:16,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret6 := main(); {2899#true} is VALID [2022-04-28 14:04:16,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2899#true} is VALID [2022-04-28 14:04:16,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {2899#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:16,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2925#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:16,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {2925#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2929#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:16,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2929#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:16,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#(not (= |assume_abort_if_not_#in~cond| 0))} {2899#true} #71#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:16,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:16,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:16,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-28 14:04:16,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-28 14:04:16,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:16,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2899#true} {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:16,133 INFO L272 TraceCheckUtils]: 17: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:16,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-28 14:04:16,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-28 14:04:16,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:16,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2899#true} {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:16,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,134 INFO L272 TraceCheckUtils]: 24: Hoare triple {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:16,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {2899#true} ~cond := #in~cond; {2983#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:16,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {2983#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:16,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:16,136 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:16,141 INFO L272 TraceCheckUtils]: 34: Hoare triple {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:16,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:16,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {3018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2900#false} is VALID [2022-04-28 14:04:16,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-28 14:04:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:04:16,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:38,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-28 14:04:38,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {3018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2900#false} is VALID [2022-04-28 14:04:38,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:38,666 INFO L272 TraceCheckUtils]: 34: Hoare triple {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:38,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:38,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:38,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 14:04:38,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 14:04:38,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 14:04:38,683 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} {2899#true} #77#return; {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 14:04:38,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:38,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {3063#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:38,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {2899#true} ~cond := #in~cond; {3063#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:04:38,684 INFO L272 TraceCheckUtils]: 24: Hoare triple {2899#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:38,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {2899#true} assume !false; {2899#true} is VALID [2022-04-28 14:04:38,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {2899#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2899#true} is VALID [2022-04-28 14:04:38,684 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2899#true} {2899#true} #75#return; {2899#true} is VALID [2022-04-28 14:04:38,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L272 TraceCheckUtils]: 17: Hoare triple {2899#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2899#true} {2899#true} #73#return; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {2899#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {2899#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2899#true} {2899#true} #71#return; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-28 14:04:38,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {2899#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret6 := main(); {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #83#return; {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2899#true} is VALID [2022-04-28 14:04:38,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-28 14:04:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743765069] [2022-04-28 14:04:38,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127558842] [2022-04-28 14:04:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127558842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:38,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:38,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 14:04:38,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102831059] [2022-04-28 14:04:38,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102831059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:38,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:38,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:04:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113031646] [2022-04-28 14:04:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 14:04:38,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:38,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:38,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:04:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:38,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:04:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:04:38,731 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:39,423 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2022-04-28 14:04:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:04:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 14:04:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-28 14:04:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-28 14:04:39,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-28 14:04:39,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:39,504 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:04:39,504 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:04:39,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:04:39,505 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:39,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 126 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:04:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:04:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-28 14:04:39,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:39,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:39,580 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:39,580 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:39,582 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-28 14:04:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-28 14:04:39,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:39,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:39,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-28 14:04:39,582 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-28 14:04:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:39,584 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-28 14:04:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-28 14:04:39,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:39,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:39,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:39,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:04:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 14:04:39,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 38 [2022-04-28 14:04:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:39,586 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-04-28 14:04:39,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:04:39,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 14:04:39,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 14:04:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 14:04:39,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:39,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:39,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:39,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:39,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-28 14:04:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:39,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114779455] [2022-04-28 14:04:39,891 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 2 times [2022-04-28 14:04:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358608474] [2022-04-28 14:04:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:39,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:39,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073169167] [2022-04-28 14:04:39,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:39,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:39,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:39,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:04:39,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:39,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:39,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:04:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:39,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:40,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3559#true} {3559#true} #83#return; {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#true} call #t~ret6 := main(); {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {3559#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3559#true} #71#return; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {3559#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L272 TraceCheckUtils]: 12: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3559#true} {3559#true} #73#return; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L272 TraceCheckUtils]: 17: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,196 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3559#true} {3559#true} #75#return; {3559#true} is VALID [2022-04-28 14:04:40,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,197 INFO L272 TraceCheckUtils]: 24: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,198 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3559#true} {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} assume !false; {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:04:40,203 INFO L272 TraceCheckUtils]: 34: Hoare triple {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:40,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:40,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3560#false} is VALID [2022-04-28 14:04:40,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-28 14:04:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:04:40,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:40,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-28 14:04:40,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3560#false} is VALID [2022-04-28 14:04:40,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:40,345 INFO L272 TraceCheckUtils]: 34: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:40,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,351 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3559#true} {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #77#return; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,351 INFO L272 TraceCheckUtils]: 24: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:40,352 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3559#true} {3559#true} #75#return; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L272 TraceCheckUtils]: 17: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3559#true} {3559#true} #73#return; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L272 TraceCheckUtils]: 12: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {3559#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3559#true} #71#return; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {3559#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#true} call #t~ret6 := main(); {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3559#true} {3559#true} #83#return; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-28 14:04:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:04:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358608474] [2022-04-28 14:04:40,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073169167] [2022-04-28 14:04:40,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073169167] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:04:40,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:04:40,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:04:40,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114779455] [2022-04-28 14:04:40,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114779455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:40,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:40,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:04:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327388166] [2022-04-28 14:04:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-28 14:04:40,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:40,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:40,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:40,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:04:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:04:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:04:40,379 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:40,738 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 14:04:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:04:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-28 14:04:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 14:04:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 14:04:40,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-28 14:04:40,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:40,799 INFO L225 Difference]: With dead ends: 69 [2022-04-28 14:04:40,799 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:04:40,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:04:40,800 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:40,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:04:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:04:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-28 14:04:40,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:40,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:40,886 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:40,886 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:40,888 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 14:04:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 14:04:40,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:40,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:40,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:04:40,889 INFO L87 Difference]: Start difference. First operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:04:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:40,890 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 14:04:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 14:04:40,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:40,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:40,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:40,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:04:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-28 14:04:40,896 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-04-28 14:04:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:40,896 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-28 14:04:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:04:40,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2022-04-28 14:04:41,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-28 14:04:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 14:04:41,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:41,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:41,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:41,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:41,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 1 times [2022-04-28 14:04:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179495951] [2022-04-28 14:04:41,742 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 2 times [2022-04-28 14:04:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257258188] [2022-04-28 14:04:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:41,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:41,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38623291] [2022-04-28 14:04:41,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:41,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:04:41,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:41,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:41,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 14:04:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:41,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:42,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {4181#true} call ULTIMATE.init(); {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {4181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4181#true} {4181#true} #83#return; {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {4181#true} call #t~ret6 := main(); {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {4181#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4181#true} is VALID [2022-04-28 14:04:42,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {4181#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:42,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#true} ~cond := #in~cond; {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:42,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:42,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:42,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4181#true} #71#return; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:42,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:42,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:42,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:42,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:42,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:42,350 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4181#true} {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:04:42,350 INFO L272 TraceCheckUtils]: 17: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:42,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {4181#true} ~cond := #in~cond; {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:42,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:42,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:42,351 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {4252#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:42,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {4252#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,352 INFO L272 TraceCheckUtils]: 24: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:42,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:42,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:42,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:42,353 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4181#true} {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !false; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,355 INFO L272 TraceCheckUtils]: 32: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:42,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:42,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:42,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:42,356 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4181#true} {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} #77#return; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:04:42,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4182#false} is VALID [2022-04-28 14:04:42,356 INFO L272 TraceCheckUtils]: 38: Hoare triple {4182#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4182#false} is VALID [2022-04-28 14:04:42,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {4182#false} ~cond := #in~cond; {4182#false} is VALID [2022-04-28 14:04:42,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {4182#false} assume 0 == ~cond; {4182#false} is VALID [2022-04-28 14:04:42,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {4182#false} assume !false; {4182#false} is VALID [2022-04-28 14:04:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 14:04:42,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:43,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {4182#false} assume !false; {4182#false} is VALID [2022-04-28 14:04:43,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {4182#false} assume 0 == ~cond; {4182#false} is VALID [2022-04-28 14:04:43,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {4182#false} ~cond := #in~cond; {4182#false} is VALID [2022-04-28 14:04:43,252 INFO L272 TraceCheckUtils]: 38: Hoare triple {4182#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4182#false} is VALID [2022-04-28 14:04:43,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {4182#false} is VALID [2022-04-28 14:04:43,253 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4181#true} {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:04:43,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:43,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:43,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:43,253 INFO L272 TraceCheckUtils]: 32: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:43,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:04:43,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {4349#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:04:43,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {4349#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-28 14:04:43,256 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4181#true} {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:04:43,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:43,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:43,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:43,256 INFO L272 TraceCheckUtils]: 24: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:43,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:04:43,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:04:43,258 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4181#true} {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-28 14:04:43,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:43,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:43,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:43,258 INFO L272 TraceCheckUtils]: 17: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:43,258 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4181#true} {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-28 14:04:43,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:43,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-28 14:04:43,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-28 14:04:43,259 INFO L272 TraceCheckUtils]: 12: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:43,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-28 14:04:43,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4181#true} #71#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-28 14:04:43,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:43,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {4421#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:43,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#true} ~cond := #in~cond; {4421#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:04:43,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {4181#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {4181#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {4181#true} call #t~ret6 := main(); {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4181#true} {4181#true} #83#return; {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {4181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {4181#true} call ULTIMATE.init(); {4181#true} is VALID [2022-04-28 14:04:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 14:04:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:43,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257258188] [2022-04-28 14:04:43,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:43,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38623291] [2022-04-28 14:04:43,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38623291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:43,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-28 14:04:43,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:43,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179495951] [2022-04-28 14:04:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179495951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:43,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:04:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73293501] [2022-04-28 14:04:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-28 14:04:43,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:43,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:04:43,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:43,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:04:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:04:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:04:43,288 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:04:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,631 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-04-28 14:04:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:04:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-28 14:04:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:04:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 14:04:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:04:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 14:04:43,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 14:04:43,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:43,678 INFO L225 Difference]: With dead ends: 74 [2022-04-28 14:04:43,678 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 14:04:43,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:04:43,678 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:43,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:04:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 14:04:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-28 14:04:43,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:43,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:43,796 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:43,796 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,798 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 14:04:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 14:04:43,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:43,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:43,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 69 states. [2022-04-28 14:04:43,798 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 69 states. [2022-04-28 14:04:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:43,800 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 14:04:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 14:04:43,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:43,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:43,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:43,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:04:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 14:04:43,802 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 42 [2022-04-28 14:04:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:43,802 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 14:04:43,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:04:43,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 14:04:45,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 14:04:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 14:04:45,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:45,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:45,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:04:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 14:04:45,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 1 times [2022-04-28 14:04:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637565661] [2022-04-28 14:04:45,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:04:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 2 times [2022-04-28 14:04:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122758148] [2022-04-28 14:04:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:45,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:45,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606571524] [2022-04-28 14:04:45,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:45,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:45,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:45,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 14:04:45,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:45,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:45,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:04:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:45,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:55,653 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 14:04:56,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {4871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #83#return; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret6 := main(); {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {4871#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4871#true} {4871#true} #71#return; {4871#true} is VALID [2022-04-28 14:04:56,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L272 TraceCheckUtils]: 12: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4871#true} {4871#true} #73#return; {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L272 TraceCheckUtils]: 17: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:04:56,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#true} ~cond := #in~cond; {4930#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:04:56,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {4930#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4934#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:56,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {4934#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4934#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:04:56,143 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4934#(not (= |assume_abort_if_not_#in~cond| 0))} {4871#true} #75#return; {4941#(<= 1 main_~y~0)} is VALID [2022-04-28 14:04:56,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {4941#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,144 INFO L272 TraceCheckUtils]: 24: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:04:56,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:04:56,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:04:56,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:04:56,145 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4871#true} {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:56,146 INFO L272 TraceCheckUtils]: 33: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:04:56,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {4871#true} ~cond := #in~cond; {4982#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:56,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {4982#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:56,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:58,149 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {4993#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 14:04:58,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {4993#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4997#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:04:58,151 INFO L272 TraceCheckUtils]: 39: Hoare triple {4997#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:58,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:58,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {5005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4872#false} is VALID [2022-04-28 14:04:58,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2022-04-28 14:04:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 14:04:58,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:23,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2022-04-28 14:05:23,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {5005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4872#false} is VALID [2022-04-28 14:05:23,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:23,231 INFO L272 TraceCheckUtils]: 39: Hoare triple {5021#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:05:23,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {5025#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5021#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:05:23,233 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} {4871#true} #77#return; {5025#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:05:23,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:23,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {5038#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {4871#true} ~cond := #in~cond; {5038#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:05:23,234 INFO L272 TraceCheckUtils]: 33: Hoare triple {4871#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {4871#true} assume !false; {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {4871#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {4871#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {4871#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4871#true} {4871#true} #77#return; {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L272 TraceCheckUtils]: 24: Hoare triple {4871#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:05:23,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {4871#true} assume !false; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {4871#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4871#true} {4871#true} #75#return; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L272 TraceCheckUtils]: 17: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4871#true} {4871#true} #73#return; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L272 TraceCheckUtils]: 12: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4871#true} is VALID [2022-04-28 14:05:23,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4871#true} {4871#true} #71#return; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {4871#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret6 := main(); {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #83#return; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {4871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2022-04-28 14:05:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 14:05:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122758148] [2022-04-28 14:05:23,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606571524] [2022-04-28 14:05:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606571524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:23,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 14:05:23,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637565661] [2022-04-28 14:05:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637565661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:23,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:05:23,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379151550] [2022-04-28 14:05:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:23,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-28 14:05:23,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:23,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:05:25,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:05:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:05:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:05:25,270 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:05:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:29,261 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-28 14:05:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:05:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-28 14:05:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:05:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-28 14:05:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:05:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-28 14:05:29,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-28 14:05:31,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:31,309 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:05:31,309 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 14:05:31,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:05:31,309 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:31,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 14:05:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 14:05:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-04-28 14:05:31,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:31,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:31,450 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:31,450 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:31,452 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 14:05:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-28 14:05:31,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:31,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:31,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 73 states. [2022-04-28 14:05:31,453 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 73 states. [2022-04-28 14:05:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:31,454 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 14:05:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-28 14:05:31,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:31,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:31,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:31,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2022-04-28 14:05:31,460 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 43 [2022-04-28 14:05:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:31,460 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2022-04-28 14:05:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:05:31,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 92 transitions. [2022-04-28 14:05:34,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-04-28 14:05:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:05:34,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:34,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:34,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 14:05:34,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:05:34,243 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 1 times [2022-04-28 14:05:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:34,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85437874] [2022-04-28 14:05:34,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:05:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 2 times [2022-04-28 14:05:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:34,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549067265] [2022-04-28 14:05:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:34,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934534472] [2022-04-28 14:05:34,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:05:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:34,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:34,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:05:34,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 14:05:34,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:05:34,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:34,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:05:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:34,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:44,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-28 14:05:44,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret6 := main(); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5599#true} {5599#true} #71#return; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L272 TraceCheckUtils]: 12: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:05:44,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5599#true} {5599#true} #73#return; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5599#true} {5599#true} #75#return; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {5599#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L272 TraceCheckUtils]: 24: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:05:44,465 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5599#true} {5599#true} #77#return; {5599#true} is VALID [2022-04-28 14:05:44,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {5599#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5691#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:44,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {5691#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5691#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:44,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {5691#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5691#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:44,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {5691#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5691#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:44,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {5691#(not (= main_~a~0 0))} assume !false; {5691#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:44,467 INFO L272 TraceCheckUtils]: 34: Hoare triple {5691#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:05:44,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {5599#true} ~cond := #in~cond; {5710#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:44,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {5710#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:44,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:46,470 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} {5691#(not (= main_~a~0 0))} #77#return; {5721#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-28 14:05:46,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {5721#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:05:46,471 INFO L272 TraceCheckUtils]: 40: Hoare triple {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:05:46,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:46,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {5733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5600#false} is VALID [2022-04-28 14:05:46,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-28 14:05:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 14:05:46,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:23,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-28 14:06:23,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {5733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5600#false} is VALID [2022-04-28 14:06:23,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:23,087 INFO L272 TraceCheckUtils]: 40: Hoare triple {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:06:23,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {5752#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:06:23,089 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} {5599#true} #77#return; {5752#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:06:23,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:06:23,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {5765#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {5599#true} ~cond := #in~cond; {5765#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:06:23,090 INFO L272 TraceCheckUtils]: 34: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {5599#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {5599#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {5599#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {5599#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5599#true} {5599#true} #77#return; {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:06:23,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L272 TraceCheckUtils]: 24: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {5599#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5599#true} {5599#true} #75#return; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L272 TraceCheckUtils]: 17: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5599#true} {5599#true} #73#return; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:06:23,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5599#true} {5599#true} #71#return; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret6 := main(); {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-28 14:06:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 14:06:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549067265] [2022-04-28 14:06:23,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934534472] [2022-04-28 14:06:23,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934534472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:23,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:23,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:06:23,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85437874] [2022-04-28 14:06:23,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85437874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:23,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:23,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:06:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755644335] [2022-04-28 14:06:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-28 14:06:23,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:23,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:06:25,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:25,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:06:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:06:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:06:25,131 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:06:28,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:06:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:28,922 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-28 14:06:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:06:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-28 14:06:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:06:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:06:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:06:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:06:28,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-28 14:06:30,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:30,963 INFO L225 Difference]: With dead ends: 85 [2022-04-28 14:06:30,963 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 14:06:30,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:06:30,964 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:30,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 144 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 14:06:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 14:06:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-04-28 14:06:31,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:31,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:31,082 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:31,082 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:31,084 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-28 14:06:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-28 14:06:31,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:31,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:31,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:06:31,084 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:06:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:31,086 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-28 14:06:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-28 14:06:31,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:31,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:31,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:31,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-04-28 14:06:31,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 44 [2022-04-28 14:06:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:31,088 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-04-28 14:06:31,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:06:31,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 82 transitions. [2022-04-28 14:06:35,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 80 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-28 14:06:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:06:35,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:35,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:35,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 14:06:35,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 14:06:35,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 1 times [2022-04-28 14:06:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:35,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874530782] [2022-04-28 14:06:35,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:06:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 2 times [2022-04-28 14:06:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:35,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015722827] [2022-04-28 14:06:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:35,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071594664] [2022-04-28 14:06:35,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:06:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:35,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:35,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:06:35,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:06:35,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:35,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:06:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:35,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:46,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #83#return; {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret6 := main(); {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:06:46,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#true} ~cond := #in~cond; {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:06:46,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:46,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:46,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} {6343#true} #71#return; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:06:46,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:06:46,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:06:46,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:06:46,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:06:46,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:06:46,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6343#true} {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:06:46,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:06:46,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#true} ~cond := #in~cond; {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:06:46,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:46,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:46,823 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {6414#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {6414#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,824 INFO L272 TraceCheckUtils]: 24: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:06:46,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:06:46,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:06:46,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:06:46,825 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6343#true} {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:46,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 14:06:46,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} assume !false; {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 14:06:46,828 INFO L272 TraceCheckUtils]: 34: Hoare triple {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:06:46,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#true} ~cond := #in~cond; {6460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:46,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {6460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:06:46,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:06:48,831 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} #77#return; {6471#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 14:06:48,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {6471#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {6475#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:06:48,833 INFO L272 TraceCheckUtils]: 40: Hoare triple {6475#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:06:48,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:48,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {6483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6344#false} is VALID [2022-04-28 14:06:48,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-28 14:06:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 14:06:48,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:22,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-28 14:07:22,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {6483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6344#false} is VALID [2022-04-28 14:07:22,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:22,539 INFO L272 TraceCheckUtils]: 40: Hoare triple {6499#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:07:22,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6499#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:07:22,540 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} {6343#true} #77#return; {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:07:22,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:07:22,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {6516#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:07:22,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#true} ~cond := #in~cond; {6516#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:07:22,541 INFO L272 TraceCheckUtils]: 34: Hoare triple {6343#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:07:22,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-28 14:07:22,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {6343#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {6343#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {6343#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {6343#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6343#true} {6343#true} #77#return; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L272 TraceCheckUtils]: 24: Hoare triple {6343#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {6343#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6343#true} {6343#true} #75#return; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:07:22,542 INFO L272 TraceCheckUtils]: 17: Hoare triple {6343#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6343#true} {6343#true} #73#return; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {6343#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {6343#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6343#true} {6343#true} #71#return; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6343#true} is VALID [2022-04-28 14:07:22,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret6 := main(); {6343#true} is VALID [2022-04-28 14:07:22,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #83#return; {6343#true} is VALID [2022-04-28 14:07:22,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-28 14:07:22,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6343#true} is VALID [2022-04-28 14:07:22,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2022-04-28 14:07:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 14:07:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:22,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015722827] [2022-04-28 14:07:22,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:22,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071594664] [2022-04-28 14:07:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071594664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:22,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-28 14:07:22,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874530782] [2022-04-28 14:07:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874530782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:22,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:22,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:07:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487152686] [2022-04-28 14:07:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-28 14:07:22,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:22,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:07:24,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:24,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:07:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:07:24,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:07:24,581 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:07:27,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:07:31,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:07:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:31,890 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-04-28 14:07:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:07:31,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-28 14:07:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:07:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-28 14:07:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:07:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-28 14:07:31,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2022-04-28 14:07:33,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:33,947 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:07:33,947 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 14:07:33,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:07:33,947 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:33,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 14:07:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 14:07:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-28 14:07:34,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:34,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:34,079 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:34,079 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:34,080 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 14:07:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 14:07:34,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:34,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:34,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-28 14:07:34,081 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-28 14:07:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:34,082 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 14:07:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 14:07:34,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:34,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:34,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:34,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-04-28 14:07:34,084 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 44 [2022-04-28 14:07:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:34,084 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-04-28 14:07:34,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:07:34,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 82 transitions. [2022-04-28 14:07:38,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 80 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-28 14:07:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 14:07:38,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:38,523 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:38,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:07:38,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:07:38,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:38,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1275543934, now seen corresponding path program 1 times [2022-04-28 14:07:38,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:38,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501085651] [2022-04-28 14:07:38,730 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:07:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1275543934, now seen corresponding path program 2 times [2022-04-28 14:07:38,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:38,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339297456] [2022-04-28 14:07:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:38,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:38,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200449182] [2022-04-28 14:07:38,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:38,756 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:38,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:07:38,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:38,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:07:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:38,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:48,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {7072#true} call ULTIMATE.init(); {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {7072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7072#true} {7072#true} #83#return; {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {7072#true} call #t~ret6 := main(); {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {7072#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L272 TraceCheckUtils]: 6: Hoare triple {7072#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:07:48,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7072#true} {7072#true} #71#return; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {7072#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L272 TraceCheckUtils]: 12: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7072#true} {7072#true} #73#return; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L272 TraceCheckUtils]: 17: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7072#true} {7072#true} #75#return; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {7072#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7072#true} is VALID [2022-04-28 14:07:48,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L272 TraceCheckUtils]: 24: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {7072#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L272 TraceCheckUtils]: 32: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:07:48,971 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-28 14:07:48,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7188#(not (= main_~b~0 0))} is VALID [2022-04-28 14:07:48,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {7188#(not (= main_~b~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7188#(not (= main_~b~0 0))} is VALID [2022-04-28 14:07:48,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {7188#(not (= main_~b~0 0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {7188#(not (= main_~b~0 0))} is VALID [2022-04-28 14:07:48,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {7188#(not (= main_~b~0 0))} assume !false; {7188#(not (= main_~b~0 0))} is VALID [2022-04-28 14:07:48,972 INFO L272 TraceCheckUtils]: 41: Hoare triple {7188#(not (= main_~b~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:07:48,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {7072#true} ~cond := #in~cond; {7204#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:48,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {7204#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:07:48,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:07:50,976 WARN L284 TraceCheckUtils]: 45: Hoare quadruple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} {7188#(not (= main_~b~0 0))} #77#return; {7215#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} is UNKNOWN [2022-04-28 14:07:50,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {7215#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:07:50,977 INFO L272 TraceCheckUtils]: 47: Hoare triple {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:07:50,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:50,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {7227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7073#false} is VALID [2022-04-28 14:07:50,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {7073#false} assume !false; {7073#false} is VALID [2022-04-28 14:07:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 14:07:50,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:14,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {7073#false} assume !false; {7073#false} is VALID [2022-04-28 14:08:14,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {7227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7073#false} is VALID [2022-04-28 14:08:14,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:14,197 INFO L272 TraceCheckUtils]: 47: Hoare triple {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:08:14,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {7246#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:08:14,200 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} {7072#true} #77#return; {7246#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:08:14,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:08:14,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {7259#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:08:14,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {7072#true} ~cond := #in~cond; {7259#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:08:14,200 INFO L272 TraceCheckUtils]: 41: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {7072#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {7072#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {7072#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L272 TraceCheckUtils]: 24: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {7072#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7072#true} {7072#true} #75#return; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L272 TraceCheckUtils]: 17: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7072#true} {7072#true} #73#return; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:08:14,202 INFO L272 TraceCheckUtils]: 12: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {7072#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7072#true} {7072#true} #71#return; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {7072#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {7072#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {7072#true} call #t~ret6 := main(); {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7072#true} {7072#true} #83#return; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {7072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7072#true} is VALID [2022-04-28 14:08:14,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {7072#true} call ULTIMATE.init(); {7072#true} is VALID [2022-04-28 14:08:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 14:08:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339297456] [2022-04-28 14:08:14,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200449182] [2022-04-28 14:08:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200449182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:14,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:08:14,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501085651] [2022-04-28 14:08:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501085651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:14,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:08:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571519852] [2022-04-28 14:08:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-04-28 14:08:14,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:14,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:08:16,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:16,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:08:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:08:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:08:16,232 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:08:19,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:08:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:22,213 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2022-04-28 14:08:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:08:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-04-28 14:08:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:08:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:08:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:08:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:08:22,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-28 14:08:24,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:24,260 INFO L225 Difference]: With dead ends: 81 [2022-04-28 14:08:24,260 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:08:24,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:08:24,261 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:24,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 158 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 14:08:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:08:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-04-28 14:08:24,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:24,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:08:24,382 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:08:24,383 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:08:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:24,384 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 14:08:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 14:08:24,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:24,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:24,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-28 14:08:24,385 INFO L87 Difference]: Start difference. First operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-28 14:08:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:24,386 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 14:08:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 14:08:24,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:24,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:24,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:24,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:08:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-04-28 14:08:24,387 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 51 [2022-04-28 14:08:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:24,387 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-04-28 14:08:24,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 14:08:24,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 74 transitions. [2022-04-28 14:08:26,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-04-28 14:08:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 14:08:26,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:08:26,815 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:08:26,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 14:08:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:08:27,018 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:08:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:08:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 1 times [2022-04-28 14:08:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70086249] [2022-04-28 14:08:27,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:08:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 2 times [2022-04-28 14:08:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:08:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009449766] [2022-04-28 14:08:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:08:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:08:27,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:08:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843631573] [2022-04-28 14:08:27,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:08:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:08:27,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:08:27,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:08:27,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:08:27,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:08:27,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:08:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:08:27,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:08:37,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {7832#true} call ULTIMATE.init(); {7832#true} is VALID [2022-04-28 14:08:37,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {7832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7832#true} {7832#true} #83#return; {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {7832#true} call #t~ret6 := main(); {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {7832#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {7832#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {7832#true} ~cond := #in~cond; {7858#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:08:37,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {7858#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7862#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:08:37,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {7862#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7862#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:08:37,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7862#(not (= |assume_abort_if_not_#in~cond| 0))} {7832#true} #71#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:08:37,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:08:37,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:08:37,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:08:37,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:08:37,919 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7832#true} {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:08:37,928 INFO L272 TraceCheckUtils]: 17: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:08:37,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:08:37,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:08:37,930 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7832#true} {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:08:37,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 14:08:37,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} assume !false; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 14:08:37,930 INFO L272 TraceCheckUtils]: 24: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:08:37,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:08:37,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:08:37,932 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7832#true} {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} #77#return; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 14:08:37,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7928#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:08:37,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {7928#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !false; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,934 INFO L272 TraceCheckUtils]: 32: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:08:37,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:08:37,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:08:37,934 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7832#true} {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} #77#return; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-28 14:08:37,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:08:37,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:08:37,941 INFO L272 TraceCheckUtils]: 42: Hoare triple {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:08:37,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {7832#true} ~cond := #in~cond; {7973#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:37,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {7973#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:08:37,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:08:39,944 WARN L284 TraceCheckUtils]: 46: Hoare quadruple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {7984#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 14:08:39,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {7984#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {7988#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} is VALID [2022-04-28 14:08:39,946 INFO L272 TraceCheckUtils]: 48: Hoare triple {7988#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:08:39,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:39,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {7996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7833#false} is VALID [2022-04-28 14:08:39,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {7833#false} assume !false; {7833#false} is VALID [2022-04-28 14:08:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:08:39,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:06,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {7833#false} assume !false; {7833#false} is VALID [2022-04-28 14:09:06,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {7996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7833#false} is VALID [2022-04-28 14:09:06,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:06,550 INFO L272 TraceCheckUtils]: 48: Hoare triple {8012#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:09:06,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {8016#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {8012#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:09:06,553 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} {7832#true} #77#return; {8016#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:09:06,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:09:06,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {8029#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:09:06,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {7832#true} ~cond := #in~cond; {8029#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:09:06,553 INFO L272 TraceCheckUtils]: 42: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {7832#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {7832#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {7832#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7832#true} {7832#true} #77#return; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L272 TraceCheckUtils]: 32: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {7832#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {7832#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7832#true} {7832#true} #77#return; {7832#true} is VALID [2022-04-28 14:09:06,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L272 TraceCheckUtils]: 24: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {7832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7832#true} {7832#true} #75#return; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L272 TraceCheckUtils]: 17: Hoare triple {7832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7832#true} {7832#true} #73#return; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:09:06,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {7832#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {7832#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7832#true} {7832#true} #71#return; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {7832#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {7832#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {7832#true} call #t~ret6 := main(); {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7832#true} {7832#true} #83#return; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {7832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7832#true} is VALID [2022-04-28 14:09:06,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {7832#true} call ULTIMATE.init(); {7832#true} is VALID [2022-04-28 14:09:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 14:09:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009449766] [2022-04-28 14:09:06,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843631573] [2022-04-28 14:09:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843631573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:06,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:06,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-28 14:09:06,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70086249] [2022-04-28 14:09:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70086249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:06,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:06,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:09:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19825346] [2022-04-28 14:09:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-28 14:09:06,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:06,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 14:09:08,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:08,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:09:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:08,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:09:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:09:08,592 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 14:09:11,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:09:14,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:09:18,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:09:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:19,393 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-04-28 14:09:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 14:09:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-28 14:09:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 14:09:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-28 14:09:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 14:09:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-28 14:09:19,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 73 transitions. [2022-04-28 14:09:25,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 70 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:25,470 INFO L225 Difference]: With dead ends: 88 [2022-04-28 14:09:25,471 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 14:09:25,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-04-28 14:09:25,471 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:25,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 152 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 269 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 14:09:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 14:09:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 14:09:25,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:25,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:25,668 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:25,668 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:25,670 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-04-28 14:09:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2022-04-28 14:09:25,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:25,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:25,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 83 states. [2022-04-28 14:09:25,670 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 83 states. [2022-04-28 14:09:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:25,672 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-04-28 14:09:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2022-04-28 14:09:25,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:25,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:25,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:25,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-04-28 14:09:25,673 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 52 [2022-04-28 14:09:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:25,673 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-04-28 14:09:25,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 14:09:25,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions. [2022-04-28 14:09:32,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 91 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:09:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:09:32,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:32,480 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:32,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:09:32,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:09:32,683 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 1 times [2022-04-28 14:09:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556750946] [2022-04-28 14:09:32,683 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:09:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 2 times [2022-04-28 14:09:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:32,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381176495] [2022-04-28 14:09:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:32,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:32,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107501330] [2022-04-28 14:09:32,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:09:32,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:32,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:32,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:32,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:09:32,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:09:32,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:32,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:09:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:32,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:33,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {8665#true} call ULTIMATE.init(); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {8665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8665#true} {8665#true} #83#return; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {8665#true} call #t~ret6 := main(); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {8665#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {8665#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8665#true} {8665#true} #71#return; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {8665#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:33,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:33,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:33,585 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8665#true} {8665#true} #73#return; {8665#true} is VALID [2022-04-28 14:09:33,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:33,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {8665#true} ~cond := #in~cond; {8724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:09:33,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {8724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:33,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:33,586 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} {8665#true} #75#return; {8735#(<= 1 main_~y~0)} is VALID [2022-04-28 14:09:33,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {8735#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8739#(<= 1 main_~b~0)} is VALID [2022-04-28 14:09:33,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {8739#(<= 1 main_~b~0)} assume !false; {8739#(<= 1 main_~b~0)} is VALID [2022-04-28 14:09:33,587 INFO L272 TraceCheckUtils]: 24: Hoare triple {8739#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:33,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:33,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:33,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:33,587 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8665#true} {8739#(<= 1 main_~b~0)} #77#return; {8739#(<= 1 main_~b~0)} is VALID [2022-04-28 14:09:33,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {8739#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !false; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,590 INFO L272 TraceCheckUtils]: 33: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:33,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:33,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:33,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:33,590 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8665#true} {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} #77#return; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8793#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {8793#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {8666#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L272 TraceCheckUtils]: 43: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {8666#false} assume !(0 == ~cond); {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {8666#false} assume true; {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8666#false} {8666#false} #77#return; {8666#false} is VALID [2022-04-28 14:09:33,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {8666#false} assume !(0 != ~a~0 && 0 != ~b~0); {8666#false} is VALID [2022-04-28 14:09:33,593 INFO L272 TraceCheckUtils]: 49: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-28 14:09:33,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-28 14:09:33,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#false} assume 0 == ~cond; {8666#false} is VALID [2022-04-28 14:09:33,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-28 14:09:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:09:33,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:34,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-28 14:09:34,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#false} assume 0 == ~cond; {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L272 TraceCheckUtils]: 49: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {8666#false} assume !(0 != ~a~0 && 0 != ~b~0); {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8665#true} {8666#false} #77#return; {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:34,461 INFO L272 TraceCheckUtils]: 43: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-28 14:09:34,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {8666#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8666#false} is VALID [2022-04-28 14:09:34,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {8869#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8666#false} is VALID [2022-04-28 14:09:34,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8869#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} is VALID [2022-04-28 14:09:34,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:34,463 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8665#true} {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} #77#return; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:34,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:34,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:34,464 INFO L272 TraceCheckUtils]: 33: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !false; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:34,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:34,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-28 14:09:34,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-28 14:09:34,467 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8665#true} {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} #77#return; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:34,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:34,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:34,467 INFO L272 TraceCheckUtils]: 24: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !false; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:34,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:34,472 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} {8665#true} #75#return; {8927#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} is VALID [2022-04-28 14:09:34,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:34,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {8940#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:34,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {8665#true} ~cond := #in~cond; {8940#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:09:34,473 INFO L272 TraceCheckUtils]: 17: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,473 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8665#true} {8665#true} #73#return; {8665#true} is VALID [2022-04-28 14:09:34,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:34,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:34,473 INFO L272 TraceCheckUtils]: 12: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {8665#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8665#true} {8665#true} #71#return; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {8665#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {8665#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {8665#true} call #t~ret6 := main(); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8665#true} {8665#true} #83#return; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {8665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {8665#true} call ULTIMATE.init(); {8665#true} is VALID [2022-04-28 14:09:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 14:09:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381176495] [2022-04-28 14:09:34,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107501330] [2022-04-28 14:09:34,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107501330] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:09:34,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:09:34,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2022-04-28 14:09:34,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556750946] [2022-04-28 14:09:34,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556750946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:34,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:34,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:09:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295783353] [2022-04-28 14:09:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-28 14:09:34,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:34,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:34,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:34,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:09:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:09:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:09:34,504 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:35,205 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2022-04-28 14:09:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:09:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-28 14:09:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 14:09:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 14:09:35,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 14:09:35,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:35,261 INFO L225 Difference]: With dead ends: 108 [2022-04-28 14:09:35,261 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:09:35,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:09:35,262 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:35,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:09:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:09:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-04-28 14:09:35,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:35,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:35,458 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:35,458 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:35,460 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2022-04-28 14:09:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2022-04-28 14:09:35,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:35,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:35,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-04-28 14:09:35,460 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-04-28 14:09:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:35,461 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2022-04-28 14:09:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2022-04-28 14:09:35,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:35,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:35,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:35,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:09:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 14:09:35,463 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 53 [2022-04-28 14:09:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:35,463 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 14:09:35,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:35,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 14:09:42,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 80 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 14:09:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 14:09:42,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:42,233 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:42,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 14:09:42,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:42,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 3 times [2022-04-28 14:09:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:42,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722232718] [2022-04-28 14:09:42,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:09:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 4 times [2022-04-28 14:09:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:42,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227309975] [2022-04-28 14:09:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:42,460 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905779442] [2022-04-28 14:09:42,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:09:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:42,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:42,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:09:42,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:09:42,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:42,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 14:09:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:42,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:43,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2022-04-28 14:09:43,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9509#true} is VALID [2022-04-28 14:09:43,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:43,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #83#return; {9509#true} is VALID [2022-04-28 14:09:43,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret6 := main(); {9509#true} is VALID [2022-04-28 14:09:43,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-28 14:09:43,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {9509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:43,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} ~cond := #in~cond; {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:09:43,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:43,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:43,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9509#true} #71#return; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:09:43,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:09:43,503 INFO L272 TraceCheckUtils]: 12: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:43,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:43,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:43,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:43,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9509#true} {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:09:43,504 INFO L272 TraceCheckUtils]: 17: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:43,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {9509#true} ~cond := #in~cond; {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:09:43,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:43,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:43,505 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {9580#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:09:43,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {9580#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,506 INFO L272 TraceCheckUtils]: 24: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:43,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:43,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:43,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:43,507 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9509#true} {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9606#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {9606#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9610#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {9610#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9614#(and (not (= (mod main_~b~0 2) 0)) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:43,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {9614#(and (not (= (mod main_~b~0 2) 0)) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !false; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,510 INFO L272 TraceCheckUtils]: 34: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:43,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:43,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:43,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:43,511 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9509#true} {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} #77#return; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:43,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9510#false} is VALID [2022-04-28 14:09:43,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-28 14:09:43,513 INFO L272 TraceCheckUtils]: 44: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-28 14:09:43,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {9510#false} assume !(0 == ~cond); {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {9510#false} assume true; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9510#false} {9510#false} #77#return; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {9510#false} assume !(0 != ~a~0 && 0 != ~b~0); {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L272 TraceCheckUtils]: 50: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-28 14:09:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:09:43,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:44,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-28 14:09:44,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-28 14:09:44,799 INFO L272 TraceCheckUtils]: 50: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {9510#false} assume !(0 != ~a~0 && 0 != ~b~0); {9510#false} is VALID [2022-04-28 14:09:44,799 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9509#true} {9510#false} #77#return; {9510#false} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:44,799 INFO L272 TraceCheckUtils]: 44: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-28 14:09:44,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {9716#(and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9510#false} is VALID [2022-04-28 14:09:44,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {9720#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9716#(and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0))} is VALID [2022-04-28 14:09:44,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9720#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:44,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:44,802 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9509#true} {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} #77#return; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:44,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:44,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:44,802 INFO L272 TraceCheckUtils]: 34: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !false; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:44,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {9749#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-28 14:09:44,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {9753#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9749#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-28 14:09:44,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {9757#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9753#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-28 14:09:44,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9757#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:44,807 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9509#true} {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} #77#return; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:44,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:44,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:44,808 INFO L272 TraceCheckUtils]: 24: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !false; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:44,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {9783#(and (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (or (<= 0 (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= 1 main_~y~0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:09:44,809 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9509#true} #75#return; {9783#(and (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (or (<= 0 (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= 1 main_~y~0)))} is VALID [2022-04-28 14:09:44,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:44,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {9796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:09:44,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {9509#true} ~cond := #in~cond; {9796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:09:44,810 INFO L272 TraceCheckUtils]: 17: Hoare triple {9509#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9509#true} {9509#true} #73#return; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {9509#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {9509#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9509#true} {9509#true} #71#return; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {9509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret6 := main(); {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #83#return; {9509#true} is VALID [2022-04-28 14:09:44,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 14:09:44,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9509#true} is VALID [2022-04-28 14:09:44,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2022-04-28 14:09:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 14:09:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:44,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227309975] [2022-04-28 14:09:44,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:44,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905779442] [2022-04-28 14:09:44,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905779442] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:09:44,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:09:44,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2022-04-28 14:09:44,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:44,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722232718] [2022-04-28 14:09:44,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722232718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:44,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:44,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:09:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403127388] [2022-04-28 14:09:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-28 14:09:44,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:44,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:44,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:44,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:09:44,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:09:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:09:44,844 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:46,091 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-28 14:09:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:09:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-28 14:09:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-28 14:09:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-28 14:09:46,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2022-04-28 14:09:46,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:46,186 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:09:46,186 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 14:09:46,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:09:46,186 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:46,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:09:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 14:09:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 14:09:46,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:46,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:09:46,427 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:09:46,427 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:09:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:46,428 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-28 14:09:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-28 14:09:46,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:46,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:46,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 74 states. [2022-04-28 14:09:46,429 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 74 states. [2022-04-28 14:09:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:46,430 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-28 14:09:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-28 14:09:46,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:46,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:46,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:46,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:09:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-04-28 14:09:46,431 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2022-04-28 14:09:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:46,432 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-04-28 14:09:46,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 14:09:46,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 92 transitions. [2022-04-28 14:09:55,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 88 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-28 14:09:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 14:09:55,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:55,416 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:55,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 14:09:55,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:09:55,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 3 times [2022-04-28 14:09:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559867072] [2022-04-28 14:09:55,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:09:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 4 times [2022-04-28 14:09:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817264816] [2022-04-28 14:09:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:55,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:55,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342943354] [2022-04-28 14:09:55,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:09:55,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:55,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:55,631 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:55,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:09:55,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:09:55,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:55,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 14:09:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:55,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:10:01,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-28 14:10:01,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10355#true} is VALID [2022-04-28 14:10:01,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:10:01,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10355#true} {10355#true} #83#return; {10355#true} is VALID [2022-04-28 14:10:01,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {10355#true} call #t~ret6 := main(); {10355#true} is VALID [2022-04-28 14:10:01,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {10355#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10355#true} is VALID [2022-04-28 14:10:01,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {10355#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:10:01,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10355#true} #71#return; {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:10:01,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:10:01,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:10:01,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-28 14:10:01,231 INFO L272 TraceCheckUtils]: 17: Hoare triple {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:10:01,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:01,232 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {10427#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {10427#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,233 INFO L272 TraceCheckUtils]: 24: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:10:01,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:10:01,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:10:01,234 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10355#true} {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {10453#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {10453#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:10:01,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:10:01,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:10:01,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:10:01,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:10:01,236 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10355#true} {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:10:01,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-28 14:10:01,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !false; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,239 INFO L272 TraceCheckUtils]: 40: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:10:01,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:10:01,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:10:01,239 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10355#true} {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} #77#return; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {10507#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {10507#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {10511#(and (not (= (mod main_~b~0 2) 0)) (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {10511#(and (not (= (mod main_~b~0 2) 0)) (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} assume !false; {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,244 INFO L272 TraceCheckUtils]: 50: Hoare triple {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:10:01,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {10355#true} ~cond := #in~cond; {10525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:01,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {10525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:10:01,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:10:01,399 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} #77#return; {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:01,403 INFO L272 TraceCheckUtils]: 56: Hoare triple {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:10:01,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {10543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:01,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {10547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10356#false} is VALID [2022-04-28 14:10:01,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-28 14:10:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 14:10:01,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:10:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:10:07,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817264816] [2022-04-28 14:10:07,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:10:07,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342943354] [2022-04-28 14:10:07,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342943354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:10:07,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:10:07,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 14:10:07,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:10:07,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559867072] [2022-04-28 14:10:07,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559867072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:10:07,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:10:07,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 14:10:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826896402] [2022-04-28 14:10:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:10:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2022-04-28 14:10:07,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:10:07,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:10:07,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:07,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 14:10:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 14:10:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:10:07,929 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:10:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:09,948 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2022-04-28 14:10:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 14:10:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2022-04-28 14:10:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:10:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:10:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-28 14:10:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:10:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-28 14:10:09,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2022-04-28 14:10:10,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:10,129 INFO L225 Difference]: With dead ends: 102 [2022-04-28 14:10:10,129 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 14:10:10,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:10:10,130 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:10:10,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 213 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 495 Invalid, 0 Unknown, 140 Unchecked, 0.6s Time] [2022-04-28 14:10:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 14:10:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-04-28 14:10:10,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:10:10,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:10:10,446 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:10:10,446 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:10:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:10,448 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-04-28 14:10:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 129 transitions. [2022-04-28 14:10:10,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:10,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:10,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 97 states. [2022-04-28 14:10:10,448 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 97 states. [2022-04-28 14:10:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:10,450 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-04-28 14:10:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 129 transitions. [2022-04-28 14:10:10,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:10,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:10,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:10:10,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:10:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:10:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-04-28 14:10:10,451 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 60 [2022-04-28 14:10:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:10:10,452 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-04-28 14:10:10,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:10:10,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 98 transitions. [2022-04-28 14:10:21,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 93 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-04-28 14:10:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:10:21,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:10:21,856 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:10:21,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 14:10:22,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:10:22,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:10:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:10:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1988072646, now seen corresponding path program 1 times [2022-04-28 14:10:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [497329034] [2022-04-28 14:10:22,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:10:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1988072646, now seen corresponding path program 2 times [2022-04-28 14:10:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:10:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642711596] [2022-04-28 14:10:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:10:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:10:22,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:10:22,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49662567] [2022-04-28 14:10:22,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:10:22,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:10:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:10:22,097 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:10:22,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:10:22,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:10:22,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:10:22,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:10:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:10:22,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:10:33,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {11137#true} call ULTIMATE.init(); {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {11137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11137#true} {11137#true} #83#return; {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {11137#true} call #t~ret6 := main(); {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {11137#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {11137#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:10:33,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11137#true} {11137#true} #71#return; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L272 TraceCheckUtils]: 12: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11137#true} {11137#true} #73#return; {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L272 TraceCheckUtils]: 17: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {11137#true} ~cond := #in~cond; {11196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:10:33,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {11196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:33,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {11200#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:10:33,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11200#(not (= |assume_abort_if_not_#in~cond| 0))} {11137#true} #75#return; {11207#(<= 1 main_~y~0)} is VALID [2022-04-28 14:10:33,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {11207#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,783 INFO L272 TraceCheckUtils]: 24: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:10:33,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:10:33,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,784 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11137#true} {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume !false; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,786 INFO L272 TraceCheckUtils]: 33: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:10:33,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:10:33,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,787 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11137#true} {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} #77#return; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11265#(and (< 0 (+ main_~a~0 1)) (exists ((aux_mod_v_main_~b~0_57_22 Int) (aux_div_v_main_~b~0_57_22 Int)) (and (<= aux_mod_v_main_~b~0_57_22 0) (<= 0 aux_mod_v_main_~b~0_57_22) (<= main_~y~0 (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22)) (<= (div (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22) 2) main_~b~0))) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {11265#(and (< 0 (+ main_~a~0 1)) (exists ((aux_mod_v_main_~b~0_57_22 Int) (aux_div_v_main_~b~0_57_22 Int)) (and (<= aux_mod_v_main_~b~0_57_22 0) (<= 0 aux_mod_v_main_~b~0_57_22) (<= main_~y~0 (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22)) (<= (div (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22) 2) main_~b~0))) (<= 1 main_~y~0))} assume !false; {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,791 INFO L272 TraceCheckUtils]: 41: Hoare triple {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:10:33,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:10:33,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:10:33,792 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11137#true} {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} #77#return; {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} assume !false; {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:33,795 INFO L272 TraceCheckUtils]: 51: Hoare triple {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:10:33,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {11137#true} ~cond := #in~cond; {11308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:33,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {11308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:10:33,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:10:35,798 WARN L284 TraceCheckUtils]: 55: Hoare quadruple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} #77#return; {11319#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 14:10:35,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {11319#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {11323#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:10:35,801 INFO L272 TraceCheckUtils]: 57: Hoare triple {11323#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:10:35,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:35,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {11331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11138#false} is VALID [2022-04-28 14:10:35,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {11138#false} assume !false; {11138#false} is VALID [2022-04-28 14:10:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 14:10:35,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:12,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {11138#false} assume !false; {11138#false} is VALID [2022-04-28 14:11:12,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {11331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11138#false} is VALID [2022-04-28 14:11:12,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:12,322 INFO L272 TraceCheckUtils]: 57: Hoare triple {11347#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:11:12,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {11351#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {11347#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:11:12,324 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} {11137#true} #77#return; {11351#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:11:12,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {11364#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {11137#true} ~cond := #in~cond; {11364#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:11:12,325 INFO L272 TraceCheckUtils]: 51: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {11137#true} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {11137#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-28 14:11:12,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L272 TraceCheckUtils]: 41: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {11137#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L272 TraceCheckUtils]: 33: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-28 14:11:12,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {11137#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L272 TraceCheckUtils]: 24: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {11137#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11137#true} {11137#true} #75#return; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L272 TraceCheckUtils]: 17: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,327 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11137#true} {11137#true} #73#return; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L272 TraceCheckUtils]: 12: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11137#true} {11137#true} #71#return; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {11137#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {11137#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {11137#true} call #t~ret6 := main(); {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11137#true} {11137#true} #83#return; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-28 14:11:12,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {11137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11137#true} is VALID [2022-04-28 14:11:12,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {11137#true} call ULTIMATE.init(); {11137#true} is VALID [2022-04-28 14:11:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 14:11:12,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:12,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642711596] [2022-04-28 14:11:12,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:12,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49662567] [2022-04-28 14:11:12,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49662567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:12,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:12,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 21 [2022-04-28 14:11:12,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:12,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [497329034] [2022-04-28 14:11:12,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [497329034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:12,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:12,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 14:11:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206685221] [2022-04-28 14:11:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2022-04-28 14:11:12,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:12,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 14:11:14,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 14:11:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 14:11:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:11:14,378 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 14:11:18,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:11:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:20,263 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2022-04-28 14:11:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 14:11:20,263 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2022-04-28 14:11:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 14:11:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 14:11:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 14:11:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 14:11:20,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-28 14:11:28,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 76 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:28,352 INFO L225 Difference]: With dead ends: 110 [2022-04-28 14:11:28,352 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 14:11:28,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-04-28 14:11:28,353 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:11:28,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 178 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 1 Unknown, 2 Unchecked, 3.2s Time] [2022-04-28 14:11:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 14:11:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-04-28 14:11:28,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:28,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:11:28,711 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:11:28,711 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:11:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:28,713 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-04-28 14:11:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-28 14:11:28,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:28,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:28,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 105 states. [2022-04-28 14:11:28,713 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 105 states. [2022-04-28 14:11:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:28,715 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-04-28 14:11:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-28 14:11:28,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:28,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:28,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:28,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:11:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-04-28 14:11:28,717 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 61 [2022-04-28 14:11:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:28,717 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-04-28 14:11:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 14:11:28,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 105 transitions. [2022-04-28 14:11:41,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 99 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-28 14:11:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 14:11:41,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:41,946 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:11:41,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:11:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:11:42,172 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 165486739, now seen corresponding path program 5 times [2022-04-28 14:11:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:42,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157195494] [2022-04-28 14:11:42,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:11:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 165486739, now seen corresponding path program 6 times [2022-04-28 14:11:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:42,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940355077] [2022-04-28 14:11:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:42,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:42,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104002777] [2022-04-28 14:11:42,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:11:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:42,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:42,189 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:11:42,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:11:42,245 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:11:42,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:42,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:11:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:42,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:51,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {12136#true} call ULTIMATE.init(); {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {12136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12136#true} {12136#true} #83#return; {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {12136#true} call #t~ret6 := main(); {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {12136#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {12136#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12136#true} {12136#true} #71#return; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {12136#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L272 TraceCheckUtils]: 12: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12136#true} {12136#true} #73#return; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L272 TraceCheckUtils]: 17: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12136#true} {12136#true} #75#return; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {12136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:11:51,265 INFO L272 TraceCheckUtils]: 24: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {12136#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L272 TraceCheckUtils]: 32: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:11:51,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L272 TraceCheckUtils]: 42: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:11:51,267 INFO L272 TraceCheckUtils]: 52: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:11:51,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {12136#true} ~cond := #in~cond; {12300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:51,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {12300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:11:51,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:11:53,271 WARN L284 TraceCheckUtils]: 56: Hoare quadruple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} {12136#true} #77#return; {12311#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-28 14:11:53,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {12311#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:11:53,273 INFO L272 TraceCheckUtils]: 58: Hoare triple {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:11:53,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:53,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {12323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12137#false} is VALID [2022-04-28 14:11:53,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {12137#false} assume !false; {12137#false} is VALID [2022-04-28 14:11:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 14:11:53,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:12:17,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {12137#false} assume !false; {12137#false} is VALID [2022-04-28 14:12:17,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {12323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12137#false} is VALID [2022-04-28 14:12:17,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:12:17,726 INFO L272 TraceCheckUtils]: 58: Hoare triple {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:12:17,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {12342#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:12:17,728 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} {12136#true} #77#return; {12342#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:12:17,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:12:17,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {12355#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:12:17,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {12136#true} ~cond := #in~cond; {12355#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:12:17,729 INFO L272 TraceCheckUtils]: 52: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L272 TraceCheckUtils]: 42: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:12:17,730 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L272 TraceCheckUtils]: 32: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {12136#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L272 TraceCheckUtils]: 24: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {12136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12136#true} is VALID [2022-04-28 14:12:17,731 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12136#true} {12136#true} #75#return; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12136#true} {12136#true} #73#return; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L272 TraceCheckUtils]: 12: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {12136#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12136#true} {12136#true} #71#return; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-28 14:12:17,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {12136#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {12136#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {12136#true} call #t~ret6 := main(); {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12136#true} {12136#true} #83#return; {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {12136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {12136#true} call ULTIMATE.init(); {12136#true} is VALID [2022-04-28 14:12:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 14:12:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:12:17,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940355077] [2022-04-28 14:12:17,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:12:17,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104002777] [2022-04-28 14:12:17,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104002777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:12:17,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:12:17,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:12:17,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:12:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157195494] [2022-04-28 14:12:17,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157195494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:12:17,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:12:17,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:12:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128868019] [2022-04-28 14:12:17,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:12:17,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-28 14:12:17,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:12:17,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:12:19,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:19,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:12:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:12:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:12:19,762 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:12:22,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:12:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:25,213 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-28 14:12:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:12:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-28 14:12:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:12:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:12:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 14:12:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:12:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 14:12:25,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-28 14:12:27,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:27,264 INFO L225 Difference]: With dead ends: 83 [2022-04-28 14:12:27,264 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:12:27,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:12:27,265 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:12:27,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 14:12:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:12:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:12:27,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:12:27,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:12:27,265 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:12:27,265 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:12:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:27,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:12:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:12:27,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:27,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:27,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:12:27,266 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:12:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:27,266 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:12:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:12:27,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:27,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:27,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:12:27,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:12:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:12:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:12:27,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2022-04-28 14:12:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:12:27,266 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:12:27,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:12:27,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:12:27,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:12:27,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:27,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:12:27,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:12:27,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:12:27,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:12:51,722 WARN L232 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 181 DAG size of output: 174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 14:13:00,030 WARN L232 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 193 DAG size of output: 183 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 14:13:13,536 WARN L232 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 201 DAG size of output: 186 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 14:13:53,945 WARN L232 SmtUtils]: Spent 37.34s on a formula simplification. DAG size of input: 161 DAG size of output: 34 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:14:17,198 WARN L232 SmtUtils]: Spent 23.15s on a formula simplification. DAG size of input: 171 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:15:05,977 WARN L232 SmtUtils]: Spent 46.16s on a formula simplification. DAG size of input: 174 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:15:31,404 WARN L232 SmtUtils]: Spent 25.38s on a formula simplification. DAG size of input: 170 DAG size of output: 26 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:15:31,412 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:15:31,412 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:15:31,412 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:15:31,412 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:15:31,412 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:15:31,412 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:15:31,412 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0)) [2022-04-28 14:15:31,413 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-28 14:15:31,413 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 60) the Hoare annotation is: true [2022-04-28 14:15:31,413 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 60) the Hoare annotation is: true [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)) (<= 1 main_~y~0))) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)) (<= 1 main_~y~0))) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 10)) (.cse1 (<= 0 main_~x~0)) (.cse2 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (.cse3 (<= 1 main_~y~0)) (.cse4 (= (* main_~b~0 main_~a~0) 0))) (or (and .cse0 .cse1 .cse2 (not (= main_~a~0 0)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~b~0 0)) .cse3 .cse4) (and (<= main_~y~0 10) .cse0 .cse1 .cse2 .cse3 .cse4))) [2022-04-28 14:15:31,413 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~y~0 10) (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-28 14:15:31,413 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L47(lines 47 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)) (<= 1 main_~y~0))) [2022-04-28 14:15:31,413 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 55) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (or (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (= main_~q~0 .cse0)) (<= 1 main_~y~0))) [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:15:31,414 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:15:31,416 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:15:31,417 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:15:31,419 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:15:31,420 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:15:33,513 INFO L163 areAnnotationChecker]: CFG has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:15:33,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:15:33 BoogieIcfgContainer [2022-04-28 14:15:33,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:15:33,522 INFO L158 Benchmark]: Toolchain (without parser) took 816215.39ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 143.5MB in the beginning and 288.4MB in the end (delta: -144.9MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2022-04-28 14:15:33,522 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:15:33,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.73ms. Allocated memory is still 191.9MB. Free memory was 143.3MB in the beginning and 167.6MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:15:33,522 INFO L158 Benchmark]: Boogie Preprocessor took 19.80ms. Allocated memory is still 191.9MB. Free memory was 167.6MB in the beginning and 166.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:15:33,522 INFO L158 Benchmark]: RCFGBuilder took 319.79ms. Allocated memory is still 191.9MB. Free memory was 166.0MB in the beginning and 153.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 14:15:33,523 INFO L158 Benchmark]: TraceAbstraction took 815690.63ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 152.9MB in the beginning and 288.4MB in the end (delta: -135.5MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. [2022-04-28 14:15:33,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.73ms. Allocated memory is still 191.9MB. Free memory was 143.3MB in the beginning and 167.6MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.80ms. Allocated memory is still 191.9MB. Free memory was 167.6MB in the beginning and 166.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 319.79ms. Allocated memory is still 191.9MB. Free memory was 166.0MB in the beginning and 153.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 815690.63ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 152.9MB in the beginning and 288.4MB in the end (delta: -135.5MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 813.5s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 82.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 183.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 34.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 2362 SdHoareTripleChecker+Invalid, 34.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 142 IncrementalHoareTripleChecker+Unchecked, 1886 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3293 IncrementalHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 476 mSDtfsCounter, 3293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 1311 SyntacticMatches, 17 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=18, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 125 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 272 PreInvPairs, 401 NumberOfFragments, 473 HoareAnnotationTreeSize, 272 FomulaSimplifications, 53826 FormulaSimplificationTreeSizeReduction, 48.8s HoareSimplificationTime, 34 FomulaSimplificationsInter, 1066809 FormulaSimplificationTreeSizeReductionInter, 135.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((y <= 10 && x <= 10) && 0 <= x) && q + b * a * p == y * x) && 1 <= y - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:15:33,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...