/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:39:05,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:39:05,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:39:05,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:39:05,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:39:05,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:39:05,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:39:05,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:39:05,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:39:05,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:39:05,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:39:05,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:39:05,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:39:05,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:39:05,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:39:05,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:39:05,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:39:05,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:39:05,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:39:05,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:39:05,570 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:39:05,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:39:05,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:39:05,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:39:05,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:39:05,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:39:05,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:39:05,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:39:05,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:39:05,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:39:05,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:39:05,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:39:05,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:39:05,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:39:05,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:39:05,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:39:05,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:39:05,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:39:05,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:39:05,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:39:05,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:39:05,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:39:05,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:39:05,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:39:05,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:39:05,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:39:05,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:39:05,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:39:05,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:39:05,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:39:05,595 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:39:05,596 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 03:39:05,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:39:05,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:39:05,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:39:05,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:39:05,749 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:39:05,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-28 03:39:05,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cb353a9/b9c16f103bbb4591abd6cc2f6629b5eb/FLAGb456135b1 [2022-04-28 03:39:06,138 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:39:06,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-28 03:39:06,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cb353a9/b9c16f103bbb4591abd6cc2f6629b5eb/FLAGb456135b1 [2022-04-28 03:39:06,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cb353a9/b9c16f103bbb4591abd6cc2f6629b5eb [2022-04-28 03:39:06,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:39:06,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:39:06,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:39:06,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:39:06,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:39:06,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3ab94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06, skipping insertion in model container [2022-04-28 03:39:06,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:39:06,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:39:06,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-28 03:39:06,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:39:06,311 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:39:06,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-28 03:39:06,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:39:06,329 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:39:06,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06 WrapperNode [2022-04-28 03:39:06,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:39:06,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:39:06,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:39:06,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:39:06,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:39:06,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:39:06,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:39:06,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:39:06,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (1/1) ... [2022-04-28 03:39:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:39:06,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:06,376 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 03:39:06,377 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 03:39:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:39:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:39:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:39:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:39:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:39:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:39:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:39:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:39:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:39:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:39:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:39:06,445 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:39:06,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:39:06,592 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:39:06,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:39:06,618 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 03:39:06,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:39:06 BoogieIcfgContainer [2022-04-28 03:39:06,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:39:06,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:39:06,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:39:06,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:39:06,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:39:06" (1/3) ... [2022-04-28 03:39:06,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609ff5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:39:06, skipping insertion in model container [2022-04-28 03:39:06,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:39:06" (2/3) ... [2022-04-28 03:39:06,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609ff5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:39:06, skipping insertion in model container [2022-04-28 03:39:06,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:39:06" (3/3) ... [2022-04-28 03:39:06,625 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-04-28 03:39:06,648 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:39:06,648 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:39:06,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:39:06,698 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@104c23a8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a277f92 [2022-04-28 03:39:06,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:39:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:39:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:39:06,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:06,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:06,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-28 03:39:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:06,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636960148] [2022-04-28 03:39:06,742 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:39:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-28 03:39:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525218639] [2022-04-28 03:39:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:06,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-28 03:39:06,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:39:06,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 03:39:06,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:06,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-28 03:39:06,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:39:06,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 03:39:06,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-28 03:39:06,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-28 03:39:06,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:39:06,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-28 03:39:06,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:39:06,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:39:06,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 03:39:06,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-28 03:39:06,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 03:39:06,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 03:39:06,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 03:39:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:06,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525218639] [2022-04-28 03:39:06,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525218639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:06,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:06,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:39:06,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636960148] [2022-04-28 03:39:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636960148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:06,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:06,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:39:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871386700] [2022-04-28 03:39:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:39:06,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:06,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:39:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:39:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:39:06,991 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,076 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 03:39:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:39:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:39:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 03:39:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 03:39:07,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-28 03:39:07,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:07,165 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:39:07,165 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:39:07,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 03:39:07,170 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:07,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:39:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:39:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:39:07,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:07,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,189 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,190 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,192 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 03:39:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:39:07,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:07,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:07,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:39:07,192 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:39:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,194 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 03:39:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:39:07,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:07,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:07,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:07,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-28 03:39:07,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-28 03:39:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:07,197 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-28 03:39:07,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-28 03:39:07,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:39:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:39:07,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:07,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:07,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:39:07,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-28 03:39:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:07,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765525273] [2022-04-28 03:39:07,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:39:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-28 03:39:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:07,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49437494] [2022-04-28 03:39:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:07,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-28 03:39:07,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 03:39:07,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 03:39:07,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:07,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-28 03:39:07,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 03:39:07,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 03:39:07,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-28 03:39:07,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:39:07,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:39:07,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-28 03:39:07,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:07,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:07,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:07,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:07,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:07,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-28 03:39:07,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-28 03:39:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:07,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49437494] [2022-04-28 03:39:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49437494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:07,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:07,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:39:07,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765525273] [2022-04-28 03:39:07,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765525273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:07,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:07,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:39:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448289376] [2022-04-28 03:39:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:39:07,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:07,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:07,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:39:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:39:07,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:39:07,564 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,920 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-28 03:39:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:39:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:39:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 03:39:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 03:39:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 03:39:07,963 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 03:39:07,964 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:39:07,964 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:39:07,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:39:07,966 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:07,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:39:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:39:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 03:39:07,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:07,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,976 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,976 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,978 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:39:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:39:07,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:07,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:07,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:07,979 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:07,980 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:39:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:39:07,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:07,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:07,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:07,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-28 03:39:07,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-28 03:39:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:07,982 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-28 03:39:07,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:07,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-28 03:39:08,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 03:39:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:39:08,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:08,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:08,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:39:08,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-04-28 03:39:08,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:08,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095319358] [2022-04-28 03:39:08,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:39:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 2 times [2022-04-28 03:39:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:08,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777729737] [2022-04-28 03:39:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:08,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:08,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-28 03:39:08,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 03:39:08,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 03:39:08,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:08,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-28 03:39:08,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 03:39:08,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 03:39:08,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 03:39:08,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-28 03:39:08,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-28 03:39:08,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(= main_~y~0 0)} ~z~0 := ~y~0; {362#(= main_~y~0 0)} is VALID [2022-04-28 03:39:08,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-28 03:39:08,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {358#false} is VALID [2022-04-28 03:39:08,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 03:39:08,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 03:39:08,055 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-28 03:39:08,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-28 03:39:08,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-28 03:39:08,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 03:39:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:08,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777729737] [2022-04-28 03:39:08,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777729737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:08,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:08,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:39:08,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095319358] [2022-04-28 03:39:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095319358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:08,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:08,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:39:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495433366] [2022-04-28 03:39:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:08,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:08,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:08,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:39:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:39:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:39:08,069 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:08,146 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 03:39:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:39:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:39:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:39:08,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 03:39:08,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:08,177 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:39:08,177 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:39:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:39:08,180 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:08,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:39:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:39:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 03:39:08,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:08,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,191 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,192 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:08,193 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:39:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:39:08,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:08,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:08,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:08,194 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:08,195 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:39:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:39:08,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:08,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:08,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:08,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-28 03:39:08,196 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2022-04-28 03:39:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:08,196 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-28 03:39:08,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:08,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-28 03:39:08,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:39:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:39:08,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:08,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:08,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:39:08,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times [2022-04-28 03:39:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:08,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823659490] [2022-04-28 03:39:11,654 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:11,656 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1734323905, now seen corresponding path program 1 times [2022-04-28 03:39:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:11,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002293843] [2022-04-28 03:39:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:11,678 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,709 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(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(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-28 03:39:11,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-28 03:39:11,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-28 03:39:11,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:11,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#(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(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-28 03:39:11,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-28 03:39:11,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-28 03:39:11,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret13 := main(); {522#true} is VALID [2022-04-28 03:39:11,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:39:11,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:39:11,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:39:11,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [76] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse3 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse4 (= v_main_~z~0_13 v_main_~z~0_12)) (.cse2 (mod v_main_~z~0_13 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~z~0_12 v_main_~z~0_13) (= (+ v_main_~x~0_11 v_main_~z~0_13 (* (- 1) v_main_~z~0_12)) v_main_~x~0_10) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_12 v_it_1 1) v_main_~z~0_13)) (not (<= 1 v_it_1)) (< 0 (mod (+ v_main_~z~0_13 (* v_it_1 4294967295)) 4294967296)))) (< 0 .cse2)))) InVars {main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_13, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_10, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 03:39:11,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} [75] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:11,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:11,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:11,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {531#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:11,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {532#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:11,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {523#false} is VALID [2022-04-28 03:39:11,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#false} assume !false; {523#false} is VALID [2022-04-28 03:39:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:11,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:11,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002293843] [2022-04-28 03:39:11,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002293843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:11,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:11,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:39:12,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823659490] [2022-04-28 03:39:12,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823659490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:12,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:12,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:39:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884248333] [2022-04-28 03:39:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:12,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:12,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:12,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:39:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:39:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:39:12,267 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:12,540 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:39:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:39:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-28 03:39:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-28 03:39:12,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-04-28 03:39:12,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:12,968 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:39:12,968 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:39:12,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:39:12,969 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:12,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 49 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-04-28 03:39:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:39:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-28 03:39:12,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:12,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,986 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:12,988 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-28 03:39:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-28 03:39:12,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:12,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:12,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:39:12,988 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:39:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:12,989 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-28 03:39:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-28 03:39:12,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:12,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:12,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:12,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 03:39:12,990 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2022-04-28 03:39:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:12,991 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 03:39:12,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:12,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 03:39:13,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:39:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:39:13,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:13,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:39:13,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-28 03:39:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778544239] [2022-04-28 03:39:13,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:13,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1936464066, now seen corresponding path program 1 times [2022-04-28 03:39:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:13,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119660314] [2022-04-28 03:39:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:13,361 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:13,380 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:13,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {717#(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(10, 2);call #Ultimate.allocInit(12, 3); {705#true} is VALID [2022-04-28 03:39:13,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-28 03:39:13,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {705#true} {705#true} #72#return; {705#true} is VALID [2022-04-28 03:39:13,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:13,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {717#(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(10, 2);call #Ultimate.allocInit(12, 3); {705#true} is VALID [2022-04-28 03:39:13,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-28 03:39:13,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #72#return; {705#true} is VALID [2022-04-28 03:39:13,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2022-04-28 03:39:13,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:13,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [78] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse3 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse0 (mod v_main_~x~0_18 4294967296))) (or (and (< v_main_~x~0_17 v_main_~x~0_18) (= v_main_~y~0_8 (+ v_main_~x~0_18 v_main_~y~0_9 (* (- 1) v_main_~x~0_17))) (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~x~0_18 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_17 v_it_2 1) v_main_~x~0_18)) (not (<= 1 v_it_2)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_17, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {711#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-28 03:39:13,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} [77] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {712#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:39:13,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {713#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~z~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:39:13,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~z~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !(~z~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:13,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:13,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:13,588 INFO L272 TraceCheckUtils]: 12: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {715#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:13,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {716#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:13,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {706#false} is VALID [2022-04-28 03:39:13,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-28 03:39:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:13,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119660314] [2022-04-28 03:39:13,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119660314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:13,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:13,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:39:15,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:15,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778544239] [2022-04-28 03:39:15,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778544239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:15,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:15,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:39:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212240480] [2022-04-28 03:39:15,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:15,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:15,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:15,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:15,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:39:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:39:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2022-04-28 03:39:15,834 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:16,364 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 03:39:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:39:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:39:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:39:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:39:16,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 03:39:18,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:18,443 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:39:18,443 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:39:18,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=70, Invalid=271, Unknown=1, NotChecked=0, Total=342 [2022-04-28 03:39:18,444 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-04-28 03:39:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:39:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-28 03:39:18,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:18,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:18,478 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:18,478 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:18,479 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 03:39:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:39:18,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:18,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:18,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:39:18,480 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:39:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:18,481 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 03:39:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:39:18,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:18,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:18,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:18,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-04-28 03:39:18,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2022-04-28 03:39:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:18,483 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-04-28 03:39:18,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:18,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 31 transitions. [2022-04-28 03:39:20,614 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 03:39:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-04-28 03:39:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:39:20,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:20,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:20,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:39:20,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-28 03:39:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971096700] [2022-04-28 03:39:20,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:20,815 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2000352087, now seen corresponding path program 1 times [2022-04-28 03:39:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:20,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341416098] [2022-04-28 03:39:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:20,825 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:20,834 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:20,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#(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(10, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-28 03:39:20,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-28 03:39:20,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #72#return; {922#true} is VALID [2022-04-28 03:39:20,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:20,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#(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(10, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-28 03:39:20,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-28 03:39:20,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #72#return; {922#true} is VALID [2022-04-28 03:39:20,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret13 := main(); {922#true} is VALID [2022-04-28 03:39:20,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {927#(= main_~y~0 0)} is VALID [2022-04-28 03:39:20,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {927#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {928#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:20,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {929#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:39:20,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [80] L23-2-->L29-1_primed: Formula: (let ((.cse1 (= v_main_~z~0_20 v_main_~z~0_19)) (.cse0 (mod v_main_~z~0_20 4294967296)) (.cse2 (= |v_main_#t~post8_9| |v_main_#t~post8_8|)) (.cse3 (= |v_main_#t~post7_9| |v_main_#t~post7_8|)) (.cse4 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and (= v_main_~z~0_19 (+ v_main_~x~0_25 v_main_~z~0_20 (* (- 1) v_main_~x~0_24))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_24)) (< 0 (mod (+ v_main_~z~0_20 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~x~0_25 v_main_~x~0_24) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_25, main_#t~post8=|v_main_#t~post8_9|, main_~z~0=v_main_~z~0_20, main_#t~post7=|v_main_#t~post7_9|} OutVars{main_~x~0=v_main_~x~0_24, main_#t~post8=|v_main_#t~post8_8|, main_~z~0=v_main_~z~0_19, main_#t~post7=|v_main_#t~post7_8|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:20,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [79] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:20,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:20,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {923#false} is VALID [2022-04-28 03:39:20,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {923#false} assume !(~x~0 % 4294967296 > 0); {923#false} is VALID [2022-04-28 03:39:20,897 INFO L272 TraceCheckUtils]: 13: Hoare triple {923#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {923#false} is VALID [2022-04-28 03:39:20,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#false} ~cond := #in~cond; {923#false} is VALID [2022-04-28 03:39:20,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {923#false} assume 0 == ~cond; {923#false} is VALID [2022-04-28 03:39:20,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-28 03:39:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:20,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:20,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341416098] [2022-04-28 03:39:20,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341416098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:20,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:20,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:39:20,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971096700] [2022-04-28 03:39:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971096700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:20,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:20,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:39:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773469807] [2022-04-28 03:39:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:20,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:20,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:20,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:20,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:20,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:39:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:39:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:39:20,944 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:21,131 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-28 03:39:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:39:21,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:39:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:39:21,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 03:39:21,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:21,165 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:39:21,165 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:39:21,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:39:21,166 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:21,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:39:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:39:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:39:21,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:21,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,197 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,197 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:21,198 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-28 03:39:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:39:21,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:21,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:21,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:39:21,198 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:39:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:21,199 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-28 03:39:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:39:21,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:21,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:21,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:21,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-28 03:39:21,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2022-04-28 03:39:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:21,200 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-28 03:39:21,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:21,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-28 03:39:21,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:39:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:39:21,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:21,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:21,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:39:21,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-04-28 03:39:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:21,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101728572] [2022-04-28 03:39:23,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:23,604 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1954242533, now seen corresponding path program 1 times [2022-04-28 03:39:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477229621] [2022-04-28 03:39:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:23,613 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:39:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:23,623 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:39:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:23,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(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(10, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-28 03:39:23,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-28 03:39:23,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1092#true} {1092#true} #72#return; {1092#true} is VALID [2022-04-28 03:39:23,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:23,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(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(10, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-28 03:39:23,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-28 03:39:23,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #72#return; {1092#true} is VALID [2022-04-28 03:39:23,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret13 := main(); {1092#true} is VALID [2022-04-28 03:39:23,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1092#true} is VALID [2022-04-28 03:39:23,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#true} [82] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_33 v_main_~x~0_32)) (.cse4 (= v_main_~y~0_16 v_main_~y~0_15)) (.cse0 (mod v_main_~x~0_33 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_32 (+ v_main_~x~0_33 v_main_~y~0_16 (* (- 1) v_main_~y~0_15))) (< v_main_~y~0_16 v_main_~y~0_15) (< 0 .cse0) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_16 v_it_4 1) v_main_~y~0_15)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_33) 4294967296)) (not (<= 1 v_it_4))))))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1092#true} is VALID [2022-04-28 03:39:23,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} [81] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-28 03:39:23,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#true} ~z~0 := ~y~0; {1097#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1098#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1093#false} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {1093#false} assume !(~y~0 % 4294967296 > 0); {1093#false} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1093#false} assume !(~x~0 % 4294967296 > 0); {1093#false} is VALID [2022-04-28 03:39:23,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {1093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1093#false} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2022-04-28 03:39:23,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2022-04-28 03:39:23,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-04-28 03:39:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:23,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:23,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477229621] [2022-04-28 03:39:23,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477229621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:23,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:23,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:39:23,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101728572] [2022-04-28 03:39:23,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101728572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:23,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:23,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:39:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618820066] [2022-04-28 03:39:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:23,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:23,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:23,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:39:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:39:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:39:23,748 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,907 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 03:39:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:39:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:39:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:39:23,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 03:39:23,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:23,945 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:39:23,945 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:39:23,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:39:23,946 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:23,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:39:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:39:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 03:39:23,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:23,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,970 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,971 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,971 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-28 03:39:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 03:39:23,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:23,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:23,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:39:23,972 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:39:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,973 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-28 03:39:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 03:39:23,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:23,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:23,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 03:39:23,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 17 [2022-04-28 03:39:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:23,974 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 03:39:23,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 03:39:24,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 03:39:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:39:24,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:24,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:24,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:39:24,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1804119273, now seen corresponding path program 1 times [2022-04-28 03:39:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:24,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502114845] [2022-04-28 03:39:24,180 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:24,181 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1494679786, now seen corresponding path program 1 times [2022-04-28 03:39:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293346559] [2022-04-28 03:39:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:24,190 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:24,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:24,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#(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(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-28 03:39:24,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-28 03:39:24,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:24,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#(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(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-28 03:39:24,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-28 03:39:24,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:24,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:24,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:24,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:24,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:24,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-28 03:39:24,236 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-28 03:39:24,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-28 03:39:24,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-28 03:39:24,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-28 03:39:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:24,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293346559] [2022-04-28 03:39:24,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293346559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:24,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915435046] [2022-04-28 03:39:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:24,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:24,238 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 03:39:24,255 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 03:39:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:24,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:39:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:24,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:24,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#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(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-28 03:39:24,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1238#true} is VALID [2022-04-28 03:39:24,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {1238#true} ~z~0 := ~y~0; {1273#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:39:24,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:39:24,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:39:24,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-28 03:39:24,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#false} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-28 03:39:24,336 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-28 03:39:24,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-28 03:39:24,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-28 03:39:24,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-28 03:39:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:24,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:39:24,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#false} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-28 03:39:24,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:39:24,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:39:24,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1238#true} ~z~0 := ~y~0; {1320#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:39:24,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1238#true} is VALID [2022-04-28 03:39:24,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-28 03:39:24,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-28 03:39:24,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-28 03:39:24,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-28 03:39:24,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-28 03:39:24,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#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(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-28 03:39:24,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1238#true} is VALID [2022-04-28 03:39:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915435046] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:24,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:39:24,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2022-04-28 03:39:24,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502114845] [2022-04-28 03:39:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502114845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:24,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:24,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:39:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768491833] [2022-04-28 03:39:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:24,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:24,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:24,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:39:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:39:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:39:24,449 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:24,539 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 03:39:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:39:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:39:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 03:39:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 03:39:24,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 03:39:24,563 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 03:39:24,564 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:39:24,564 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:39:24,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:39:24,565 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:24,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:39:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:39:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 03:39:24,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:24,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,593 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,594 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:24,595 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 03:39:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 03:39:24,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:24,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:24,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:39:24,596 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:39:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:24,598 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 03:39:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 03:39:24,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:24,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:24,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:24,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 03:39:24,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2022-04-28 03:39:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:24,599 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 03:39:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:24,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 03:39:24,638 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 03:39:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:39:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:39:24,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:24,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:24,658 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 03:39:24,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:24,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-28 03:39:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:24,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618716015] [2022-04-28 03:39:25,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:25,009 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash -988846895, now seen corresponding path program 1 times [2022-04-28 03:39:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:25,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591209019] [2022-04-28 03:39:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:25,024 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:25,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:25,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#(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(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 03:39:25,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 03:39:25,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-28 03:39:25,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:25,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#(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(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 03:39:25,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 03:39:25,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-28 03:39:25,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-28 03:39:25,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-28 03:39:25,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-28 03:39:25,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:25,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:25,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-28 03:39:25,062 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-28 03:39:25,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-28 03:39:25,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-28 03:39:25,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-28 03:39:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:39:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591209019] [2022-04-28 03:39:25,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591209019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033611520] [2022-04-28 03:39:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:25,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:25,064 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 03:39:25,065 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 03:39:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:25,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:39:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:25,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:25,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-28 03:39:25,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 03:39:25,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 03:39:25,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-28 03:39:25,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-28 03:39:25,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-28 03:39:25,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-28 03:39:25,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:25,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:25,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:25,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:25,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:25,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:25,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-28 03:39:25,388 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-28 03:39:25,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-28 03:39:25,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-28 03:39:25,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-28 03:39:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:39:25,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:39:25,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-28 03:39:25,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-28 03:39:25,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-28 03:39:25,494 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-28 03:39:25,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-28 03:39:25,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:39:25,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:39:25,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:39:25,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-28 03:39:25,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-28 03:39:25,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-28 03:39:25,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-28 03:39:25,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-28 03:39:25,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-28 03:39:25,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-28 03:39:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:39:25,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033611520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:39:25,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:39:25,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:39:25,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:25,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618716015] [2022-04-28 03:39:25,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618716015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:25,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:25,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:39:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008191143] [2022-04-28 03:39:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:39:25,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:25,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:25,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:39:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:39:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:39:25,532 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:25,739 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-28 03:39:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:39:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:39:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 03:39:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 03:39:25,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-28 03:39:25,780 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 03:39:25,780 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:39:25,781 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:39:25,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:39:25,781 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:25,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:39:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:39:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-28 03:39:25,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:25,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,850 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,850 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:25,851 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 03:39:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 03:39:25,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:25,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:25,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:39:25,852 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:39:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:25,857 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 03:39:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 03:39:25,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:25,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:25,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:25,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-28 03:39:25,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2022-04-28 03:39:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:25,859 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-28 03:39:25,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:25,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-28 03:39:25,946 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 03:39:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 03:39:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:39:25,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:25,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:25,964 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 03:39:26,155 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,SelfDestructingSolverStorable8 [2022-04-28 03:39:26,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-28 03:39:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:26,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022876430] [2022-04-28 03:39:26,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:39:26,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -883628153, now seen corresponding path program 1 times [2022-04-28 03:39:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:26,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735562054] [2022-04-28 03:39:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:26,364 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:26,388 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:26,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {1793#(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(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 03:39:26,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 03:39:26,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-28 03:39:26,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:26,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#(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(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 03:39:26,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 03:39:26,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-28 03:39:26,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-28 03:39:26,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:26,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1784#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-28 03:39:26,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {1784#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1785#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:39:26,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {1786#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:39:26,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1787#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) 1))} is VALID [2022-04-28 03:39:26,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1787#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) 1))} assume !(~z~0 % 4294967296 > 0); {1788#(and (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:26,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(and (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-28 03:39:26,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-28 03:39:26,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:26,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:26,696 INFO L272 TraceCheckUtils]: 15: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1791#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:26,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1792#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:26,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 03:39:26,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 03:39:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:26,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735562054] [2022-04-28 03:39:26,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735562054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:26,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910978131] [2022-04-28 03:39:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:26,698 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 03:39:26,699 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 03:39:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:27,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:39:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:27,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:46,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 03:39:46,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#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(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 03:39:46,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 03:39:46,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-28 03:39:46,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-28 03:39:46,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:46,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:39:46,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:39:46,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} ~z~0 := ~y~0; {1822#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-28 03:39:46,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1826#(and (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:39:46,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {1826#(and (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1830#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:39:46,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {1830#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1834#(and (not (< 0 (mod main_~y~0 4294967296))) (< main_~x~0 (+ main_~n~0 1)) (= main_~z~0 (+ main_~y~0 1)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:39:46,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1834#(and (not (< 0 (mod main_~y~0 4294967296))) (< main_~x~0 (+ main_~n~0 1)) (= main_~z~0 (+ main_~y~0 1)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1838#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:39:46,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {1838#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1842#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 1 main_~z~0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:39:46,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1842#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 1 main_~z~0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1846#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (< 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 03:39:46,688 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (< 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:39:46,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:39:46,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 03:39:46,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 03:39:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:46,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:20,362 WARN L232 SmtUtils]: Spent 45.45s on a formula simplification. DAG size of input: 75 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:41:21,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 03:41:21,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 03:41:21,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:21,431 INFO L272 TraceCheckUtils]: 15: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:21,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:21,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1873#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:41:21,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1881#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1877#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 03:41:21,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1881#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:21,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1889#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {1885#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 03:41:21,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1893#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1889#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 03:41:21,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1897#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {1893#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:21,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1897#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1897#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:23,463 WARN L290 TraceCheckUtils]: 6: Hoare triple {1904#(and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (<= 4294967296 aux_mod_aux_mod_v_main_~x~0_67_31_123) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123) (* main_~n~0 2)) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 1)) (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (< aux_mod_aux_mod_v_main_~x~0_67_31_123 0) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1897#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:41:23,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1904#(and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (<= 4294967296 aux_mod_aux_mod_v_main_~x~0_67_31_123) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123) (* main_~n~0 2)) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 1)) (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (< aux_mod_aux_mod_v_main_~x~0_67_31_123 0) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))))} is VALID [2022-04-28 03:41:23,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-28 03:41:23,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-28 03:41:23,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 03:41:23,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#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(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 03:41:23,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 03:41:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:23,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910978131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:23,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:23,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-28 03:41:26,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022876430] [2022-04-28 03:41:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022876430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:41:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388273594] [2022-04-28 03:41:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:26,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:26,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:26,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:41:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:41:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=828, Unknown=17, NotChecked=0, Total=992 [2022-04-28 03:41:26,194 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,538 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-28 03:41:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:41:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-28 03:41:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-28 03:41:33,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 35 transitions. [2022-04-28 03:41:33,704 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 03:41:33,704 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:41:33,704 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:41:33,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 101.9s TimeCoverageRelationStatistics Valid=204, Invalid=1336, Unknown=20, NotChecked=0, Total=1560 [2022-04-28 03:41:33,705 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:33,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2022-04-28 03:41:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:41:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 03:41:33,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:33,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,773 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,773 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,774 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:41:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 03:41:33,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:33,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:33,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:33,774 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,775 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:41:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 03:41:33,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:33,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:33,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:33,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-04-28 03:41:33,776 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2022-04-28 03:41:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:33,776 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-04-28 03:41:33,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 34 transitions. [2022-04-28 03:41:34,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-04-28 03:41:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:34,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:34,007 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:34,011 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 03:41:34,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:34,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-28 03:41:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:34,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495203093] [2022-04-28 03:41:34,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:34,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1108870161, now seen corresponding path program 1 times [2022-04-28 03:41:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:34,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528968947] [2022-04-28 03:41:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:34,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:34,424 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:34,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {2133#(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(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-28 03:41:34,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:34,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2126#true} {2126#true} #72#return; {2126#true} is VALID [2022-04-28 03:41:34,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:34,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2133#(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(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-28 03:41:34,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:34,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #72#return; {2126#true} is VALID [2022-04-28 03:41:34,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret13 := main(); {2126#true} is VALID [2022-04-28 03:41:34,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:34,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:34,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2127#false} is VALID [2022-04-28 03:41:34,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {2127#false} assume !(~x~0 % 4294967296 > 0); {2127#false} is VALID [2022-04-28 03:41:34,478 INFO L272 TraceCheckUtils]: 16: Hoare triple {2127#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2127#false} is VALID [2022-04-28 03:41:34,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {2127#false} ~cond := #in~cond; {2127#false} is VALID [2022-04-28 03:41:34,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {2127#false} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:34,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528968947] [2022-04-28 03:41:34,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528968947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407356051] [2022-04-28 03:41:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:34,480 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 03:41:34,481 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 03:41:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:34,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:41:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:34,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:34,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #72#return; {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret13 := main(); {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:34,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:34,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2127#false} is VALID [2022-04-28 03:41:34,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2127#false} assume !(~x~0 % 4294967296 > 0); {2127#false} is VALID [2022-04-28 03:41:34,725 INFO L272 TraceCheckUtils]: 16: Hoare triple {2127#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2127#false} is VALID [2022-04-28 03:41:34,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {2127#false} ~cond := #in~cond; {2127#false} is VALID [2022-04-28 03:41:34,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {2127#false} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:34,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:34,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:34,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:34,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {2127#false} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:34,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {2127#false} ~cond := #in~cond; {2127#false} is VALID [2022-04-28 03:41:34,884 INFO L272 TraceCheckUtils]: 16: Hoare triple {2127#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2127#false} is VALID [2022-04-28 03:41:34,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {2127#false} assume !(~x~0 % 4294967296 > 0); {2127#false} is VALID [2022-04-28 03:41:34,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2127#false} is VALID [2022-04-28 03:41:34,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2132#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:34,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2131#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:34,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret13 := main(); {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #72#return; {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 03:41:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:34,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407356051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:34,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:34,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:41:34,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495203093] [2022-04-28 03:41:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495203093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:34,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115853867] [2022-04-28 03:41:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:34,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:34,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:34,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:34,961 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,203 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 03:41:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 03:41:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 03:41:35,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 03:41:35,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:35,254 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:41:35,254 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:41:35,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:35,254 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:35,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 22 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:41:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 03:41:35,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:35,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,327 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,327 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,328 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:41:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 03:41:35,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:35,328 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,329 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:41:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 03:41:35,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:35,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-28 03:41:35,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 20 [2022-04-28 03:41:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:35,330 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-28 03:41:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:35,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-28 03:41:35,780 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 03:41:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 03:41:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:35,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:35,781 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:35,797 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 03:41:35,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:35,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-04-28 03:41:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:35,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706339777] [2022-04-28 03:41:36,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:36,168 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 48954306, now seen corresponding path program 1 times [2022-04-28 03:41:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:36,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371283333] [2022-04-28 03:41:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:36,177 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {2463#(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(10, 2);call #Ultimate.allocInit(12, 3); {2454#true} is VALID [2022-04-28 03:41:36,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {2454#true} assume true; {2454#true} is VALID [2022-04-28 03:41:36,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2454#true} {2454#true} #72#return; {2454#true} is VALID [2022-04-28 03:41:36,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {2454#true} call ULTIMATE.init(); {2463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:36,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#(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(10, 2);call #Ultimate.allocInit(12, 3); {2454#true} is VALID [2022-04-28 03:41:36,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2454#true} assume true; {2454#true} is VALID [2022-04-28 03:41:36,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2454#true} {2454#true} #72#return; {2454#true} is VALID [2022-04-28 03:41:36,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {2454#true} call #t~ret13 := main(); {2454#true} is VALID [2022-04-28 03:41:36,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {2454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2454#true} is VALID [2022-04-28 03:41:36,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {2454#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2454#true} is VALID [2022-04-28 03:41:36,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2454#true} is VALID [2022-04-28 03:41:36,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2454#true} ~z~0 := ~y~0; {2459#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:36,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {2459#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2460#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:36,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {2460#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:36,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:36,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2455#false} is VALID [2022-04-28 03:41:36,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#false} assume !(~y~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#false} assume !(~x~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L272 TraceCheckUtils]: 16: Hoare triple {2455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#false} ~cond := #in~cond; {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {2455#false} assume 0 == ~cond; {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#false} assume !false; {2455#false} is VALID [2022-04-28 03:41:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:36,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371283333] [2022-04-28 03:41:36,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371283333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:36,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237544529] [2022-04-28 03:41:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:36,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:36,276 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 03:41:36,277 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 03:41:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:36,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {2454#true} call ULTIMATE.init(); {2454#true} is VALID [2022-04-28 03:41:36,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {2454#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(10, 2);call #Ultimate.allocInit(12, 3); {2454#true} is VALID [2022-04-28 03:41:36,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {2454#true} assume true; {2454#true} is VALID [2022-04-28 03:41:36,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2454#true} {2454#true} #72#return; {2454#true} is VALID [2022-04-28 03:41:36,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {2454#true} call #t~ret13 := main(); {2454#true} is VALID [2022-04-28 03:41:36,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {2454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2454#true} is VALID [2022-04-28 03:41:36,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {2454#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2454#true} is VALID [2022-04-28 03:41:36,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2454#true} is VALID [2022-04-28 03:41:36,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2454#true} ~z~0 := ~y~0; {2459#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:36,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {2459#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2494#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:36,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {2494#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:36,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#false} assume !(~y~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#false} assume !(~x~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L272 TraceCheckUtils]: 16: Hoare triple {2455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#false} ~cond := #in~cond; {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {2455#false} assume 0 == ~cond; {2455#false} is VALID [2022-04-28 03:41:36,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#false} assume !false; {2455#false} is VALID [2022-04-28 03:41:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:36,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:36,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#false} assume !false; {2455#false} is VALID [2022-04-28 03:41:36,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {2455#false} assume 0 == ~cond; {2455#false} is VALID [2022-04-28 03:41:36,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#false} ~cond := #in~cond; {2455#false} is VALID [2022-04-28 03:41:36,850 INFO L272 TraceCheckUtils]: 16: Hoare triple {2455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2455#false} is VALID [2022-04-28 03:41:36,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#false} assume !(~x~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2455#false} is VALID [2022-04-28 03:41:36,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#false} assume !(~y~0 % 4294967296 > 0); {2455#false} is VALID [2022-04-28 03:41:36,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2455#false} is VALID [2022-04-28 03:41:36,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2462#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:36,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {2552#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2461#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:36,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2552#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {2454#true} ~z~0 := ~y~0; {2556#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {2454#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {2454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {2454#true} call #t~ret13 := main(); {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2454#true} {2454#true} #72#return; {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2454#true} assume true; {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {2454#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(10, 2);call #Ultimate.allocInit(12, 3); {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {2454#true} call ULTIMATE.init(); {2454#true} is VALID [2022-04-28 03:41:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237544529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:36,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 03:41:36,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:36,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706339777] [2022-04-28 03:41:36,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706339777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824829518] [2022-04-28 03:41:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:36,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:36,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:36,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:36,926 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,329 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 03:41:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:41:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 03:41:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 03:41:37,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 03:41:37,388 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 03:41:37,388 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:41:37,388 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:41:37,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:41:37,389 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:37,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 39 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:41:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 03:41:37,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:37,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,472 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,472 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,479 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 03:41:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 03:41:37,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:37,480 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,481 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 03:41:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 03:41:37,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:37,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-28 03:41:37,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-04-28 03:41:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:37,482 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-28 03:41:37,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-28 03:41:37,683 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 03:41:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-28 03:41:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:37,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:37,684 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:37,700 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 03:41:37,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 03:41:37,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2032182702, now seen corresponding path program 4 times [2022-04-28 03:41:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:37,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865327973] [2022-04-28 03:41:40,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:40,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 80075571, now seen corresponding path program 1 times [2022-04-28 03:41:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:40,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241452751] [2022-04-28 03:41:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:40,084 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,093 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {2851#(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(10, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-28 03:41:40,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 03:41:40,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2842#true} {2842#true} #72#return; {2842#true} is VALID [2022-04-28 03:41:40,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:40,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#(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(10, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-28 03:41:40,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 03:41:40,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #72#return; {2842#true} is VALID [2022-04-28 03:41:40,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret13 := main(); {2842#true} is VALID [2022-04-28 03:41:40,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2842#true} is VALID [2022-04-28 03:41:40,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {2842#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2842#true} is VALID [2022-04-28 03:41:40,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:40,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:40,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:40,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {2848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:40,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:40,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:40,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:40,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {2849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2850#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:40,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2843#false} is VALID [2022-04-28 03:41:40,149 INFO L272 TraceCheckUtils]: 16: Hoare triple {2843#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2843#false} is VALID [2022-04-28 03:41:40,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {2843#false} ~cond := #in~cond; {2843#false} is VALID [2022-04-28 03:41:40,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#false} assume 0 == ~cond; {2843#false} is VALID [2022-04-28 03:41:40,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-28 03:41:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241452751] [2022-04-28 03:41:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241452751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789908256] [2022-04-28 03:41:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:40,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:40,150 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 03:41:40,151 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 03:41:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:40,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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(10, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #72#return; {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret13 := main(); {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {2842#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2842#true} is VALID [2022-04-28 03:41:40,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2842#true} is VALID [2022-04-28 03:41:40,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#true} ~z~0 := ~y~0; {2879#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:40,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {2879#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2883#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:41:40,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:40,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2894#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {2894#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2843#false} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2843#false} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#false} assume !(~x~0 % 4294967296 > 0); {2843#false} is VALID [2022-04-28 03:41:40,257 INFO L272 TraceCheckUtils]: 16: Hoare triple {2843#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2843#false} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {2843#false} ~cond := #in~cond; {2843#false} is VALID [2022-04-28 03:41:40,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#false} assume 0 == ~cond; {2843#false} is VALID [2022-04-28 03:41:40,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-28 03:41:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:40,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:40,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#false} assume 0 == ~cond; {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {2843#false} ~cond := #in~cond; {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L272 TraceCheckUtils]: 16: Hoare triple {2843#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#false} assume !(~x~0 % 4294967296 > 0); {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2843#false} is VALID [2022-04-28 03:41:40,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {2894#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2843#false} is VALID [2022-04-28 03:41:40,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2894#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:40,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:40,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {2943#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2887#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2943#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#true} ~z~0 := ~y~0; {2947#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {2842#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret13 := main(); {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #72#return; {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-28 03:41:40,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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(10, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-28 03:41:40,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-28 03:41:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:40,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789908256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:40,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:40,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 03:41:40,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:40,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865327973] [2022-04-28 03:41:40,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865327973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:40,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:40,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470754366] [2022-04-28 03:41:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:40,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:40,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:41:40,417 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:40,854 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-28 03:41:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:41:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 03:41:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 03:41:40,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-28 03:41:40,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:40,903 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:41:40,903 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:41:40,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:41:40,903 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:40,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:41:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-28 03:41:41,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:41,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,037 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,037 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:41,038 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 03:41:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-28 03:41:41,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:41,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:41,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:41:41,039 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:41:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:41,040 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 03:41:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-28 03:41:41,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:41,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:41,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2022-04-28 03:41:41,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 20 [2022-04-28 03:41:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:41,042 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-04-28 03:41:41,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 58 transitions. [2022-04-28 03:41:41,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-28 03:41:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:41,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:41,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:41,290 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 03:41:41,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:41,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1461340774, now seen corresponding path program 5 times [2022-04-28 03:41:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:41,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150229753] [2022-04-28 03:41:41,666 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:41,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 225856869, now seen corresponding path program 1 times [2022-04-28 03:41:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:41,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372145588] [2022-04-28 03:41:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:41,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,685 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {3305#(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(10, 2);call #Ultimate.allocInit(12, 3); {3296#true} is VALID [2022-04-28 03:41:41,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3296#true} assume true; {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3296#true} {3296#true} #72#return; {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {3296#true} call ULTIMATE.init(); {3305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:41,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {3305#(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(10, 2);call #Ultimate.allocInit(12, 3); {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {3296#true} assume true; {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3296#true} {3296#true} #72#return; {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {3296#true} call #t~ret13 := main(); {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {3296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#true} is VALID [2022-04-28 03:41:41,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3296#true} is VALID [2022-04-28 03:41:41,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {3296#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3296#true} is VALID [2022-04-28 03:41:41,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {3296#true} ~z~0 := ~y~0; {3301#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:41,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {3301#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:41,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {3302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:41,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:41,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3304#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:41,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {3304#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:41,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {3297#false} assume !(~x~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L272 TraceCheckUtils]: 17: Hoare triple {3297#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#false} ~cond := #in~cond; {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {3297#false} assume 0 == ~cond; {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {3297#false} assume !false; {3297#false} is VALID [2022-04-28 03:41:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372145588] [2022-04-28 03:41:41,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372145588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618886601] [2022-04-28 03:41:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:41,745 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 03:41:41,746 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 03:41:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:41:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:41,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {3296#true} call ULTIMATE.init(); {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {3296#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(10, 2);call #Ultimate.allocInit(12, 3); {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {3296#true} assume true; {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3296#true} {3296#true} #72#return; {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {3296#true} call #t~ret13 := main(); {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {3296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {3296#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3296#true} is VALID [2022-04-28 03:41:41,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {3296#true} ~z~0 := ~y~0; {3301#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:41,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {3301#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:41,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {3302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3339#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:41,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {3339#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3339#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:41,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {3339#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3346#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:41,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {3346#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {3297#false} assume !(~x~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L272 TraceCheckUtils]: 17: Hoare triple {3297#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#false} ~cond := #in~cond; {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {3297#false} assume 0 == ~cond; {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {3297#false} assume !false; {3297#false} is VALID [2022-04-28 03:41:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {3297#false} assume !false; {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {3297#false} assume 0 == ~cond; {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#false} ~cond := #in~cond; {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L272 TraceCheckUtils]: 17: Hoare triple {3297#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {3297#false} assume !(~x~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:42,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {3297#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3297#false} is VALID [2022-04-28 03:41:42,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {3304#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3297#false} is VALID [2022-04-28 03:41:42,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3304#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:42,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:42,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {3401#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3303#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:42,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3401#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:41:42,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {3296#true} ~z~0 := ~y~0; {3405#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 03:41:42,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {3296#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3296#true} is VALID [2022-04-28 03:41:42,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3296#true} is VALID [2022-04-28 03:41:42,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {3296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {3296#true} call #t~ret13 := main(); {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3296#true} {3296#true} #72#return; {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {3296#true} assume true; {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {3296#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(10, 2);call #Ultimate.allocInit(12, 3); {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {3296#true} call ULTIMATE.init(); {3296#true} is VALID [2022-04-28 03:41:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:42,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618886601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:42,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:42,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 03:41:42,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150229753] [2022-04-28 03:41:42,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150229753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:42,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:42,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642581729] [2022-04-28 03:41:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:41:42,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:42,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:42,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:42,221 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,655 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-28 03:41:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:41:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:41:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 03:41:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 03:41:42,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-28 03:41:42,688 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 03:41:42,689 INFO L225 Difference]: With dead ends: 59 [2022-04-28 03:41:42,689 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:41:42,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:41:42,690 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:42,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:41:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 03:41:42,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:42,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,789 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,789 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,789 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 03:41:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 03:41:42,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:41:42,790 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:41:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,790 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 03:41:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 03:41:42,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:42,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-28 03:41:42,791 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 21 [2022-04-28 03:41:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:42,791 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-28 03:41:42,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-28 03:41:43,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-28 03:41:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:43,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:43,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:43,639 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 03:41:43,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:43,824 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 6 times [2022-04-28 03:41:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:43,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046896537] [2022-04-28 03:41:44,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:44,021 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash -61480798, now seen corresponding path program 1 times [2022-04-28 03:41:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:44,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251843025] [2022-04-28 03:41:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:44,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:44,076 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:44,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {3730#(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(10, 2);call #Ultimate.allocInit(12, 3); {3712#true} is VALID [2022-04-28 03:41:44,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {3712#true} assume true; {3712#true} is VALID [2022-04-28 03:41:44,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3712#true} {3712#true} #72#return; {3712#true} is VALID [2022-04-28 03:41:44,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {3712#true} call ULTIMATE.init(); {3730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:44,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {3730#(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(10, 2);call #Ultimate.allocInit(12, 3); {3712#true} is VALID [2022-04-28 03:41:44,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {3712#true} assume true; {3712#true} is VALID [2022-04-28 03:41:44,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3712#true} {3712#true} #72#return; {3712#true} is VALID [2022-04-28 03:41:44,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {3712#true} call #t~ret13 := main(); {3712#true} is VALID [2022-04-28 03:41:44,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {3712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3717#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:44,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {3717#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3718#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:44,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {3718#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3719#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:41:44,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {3719#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {3720#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:41:44,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {3720#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3721#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= (+ (* (div (+ main_~z~0 1) 4294967296) 2147483648) main_~n~0) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 2147483648) 1)))} is VALID [2022-04-28 03:41:44,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {3721#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= (+ (* (div (+ main_~z~0 1) 4294967296) 2147483648) main_~n~0) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 2147483648) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3722#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 2147483648)) 2147483648) 4294967296) main_~z~0 4) (* main_~n~0 2))} is VALID [2022-04-28 03:41:44,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {3722#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 2147483648)) 2147483648) 4294967296) main_~z~0 4) (* main_~n~0 2))} assume !(~z~0 % 4294967296 > 0); {3723#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648) 4294967296) 4))} is VALID [2022-04-28 03:41:44,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648) 4294967296) 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3724#(<= (* main_~n~0 2) (+ main_~z~0 3 (* 4294967296 (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 1) main_~n~0) 2147483648))))} is VALID [2022-04-28 03:41:44,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {3724#(<= (* main_~n~0 2) (+ main_~z~0 3 (* 4294967296 (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 1) main_~n~0) 2147483648))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3725#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} is VALID [2022-04-28 03:41:44,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {3725#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3725#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} is VALID [2022-04-28 03:41:44,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {3725#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3726#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648) 4294967296) 1))} is VALID [2022-04-28 03:41:44,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {3726#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:44,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:44,488 INFO L272 TraceCheckUtils]: 18: Hoare triple {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3728#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:44,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {3728#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3729#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:44,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {3729#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3713#false} is VALID [2022-04-28 03:41:44,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {3713#false} assume !false; {3713#false} is VALID [2022-04-28 03:41:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251843025] [2022-04-28 03:41:44,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251843025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092273488] [2022-04-28 03:41:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:44,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:44,490 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 03:41:44,491 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 03:41:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:41:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:09,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {3712#true} call ULTIMATE.init(); {3712#true} is VALID [2022-04-28 03:43:09,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {3712#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(10, 2);call #Ultimate.allocInit(12, 3); {3712#true} is VALID [2022-04-28 03:43:09,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {3712#true} assume true; {3712#true} is VALID [2022-04-28 03:43:09,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3712#true} {3712#true} #72#return; {3712#true} is VALID [2022-04-28 03:43:09,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {3712#true} call #t~ret13 := main(); {3712#true} is VALID [2022-04-28 03:43:09,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {3712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3717#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:43:09,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {3717#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3752#(or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:43:09,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {3752#(or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3756#(and (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:43:09,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {3756#(and (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {3760#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} is VALID [2022-04-28 03:43:11,813 WARN L290 TraceCheckUtils]: 9: Hoare triple {3760#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3764#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is UNKNOWN [2022-04-28 03:43:11,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3768#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-28 03:43:11,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {3768#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {3772#(and (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:43:11,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {3772#(and (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3776#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-28 03:43:11,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3780#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-28 03:43:11,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {3780#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !(~y~0 % 4294967296 > 0); {3780#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-28 03:43:11,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {3780#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3787#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 03:43:11,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {3787#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3791#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-28 03:43:11,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {3791#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {3791#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-28 03:43:13,935 WARN L272 TraceCheckUtils]: 18: Hoare triple {3791#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3798#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 03:43:13,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:43:13,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {3802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3713#false} is VALID [2022-04-28 03:43:13,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {3713#false} assume !false; {3713#false} is VALID [2022-04-28 03:43:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:13,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:59,208 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (let ((.cse5 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125))) (let ((.cse3 (+ .cse5 aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (.cse2 (+ 2 c_main_~x~0 c_main_~y~0)) (.cse1 (* aux_div_v_main_~y~0_96_46 4294967296)) (.cse0 (+ 4294967292 .cse5 aux_mod_aux_mod_v_main_~x~0_127_32_125))) (or (< .cse0 .cse1) (< .cse2 .cse3) (exists ((v_it_12 Int)) (and (not (< 0 (mod (+ (* 4294967295 v_it_12) c_main_~x~0) 4294967296))) (<= (+ 3 v_it_12 c_main_~y~0) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12))) (< .cse3 .cse2) (let ((.cse4 (* 2 c_main_~n~0))) (<= (+ aux_mod_aux_mod_v_main_~x~0_127_32_125 (* (div .cse4 4294967296) 4294967296)) .cse4)) (>= aux_mod_aux_mod_v_main_~x~0_127_32_125 4294967296) (< .cse1 .cse0) (not (< (+ 2 c_main_~y~0) (+ .cse5 aux_mod_aux_mod_v_main_~x~0_127_32_125))))))) (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (let ((.cse11 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125))) (let ((.cse9 (+ .cse11 aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (.cse8 (+ 2 c_main_~x~0 c_main_~y~0)) (.cse7 (* aux_div_v_main_~y~0_96_46 4294967296)) (.cse6 (+ 4294967292 .cse11 aux_mod_aux_mod_v_main_~x~0_127_32_125))) (or (> 0 aux_mod_aux_mod_v_main_~x~0_127_32_125) (< .cse6 .cse7) (< .cse8 .cse9) (exists ((v_it_12 Int)) (and (not (< 0 (mod (+ (* 4294967295 v_it_12) c_main_~x~0) 4294967296))) (<= (+ 3 v_it_12 c_main_~y~0) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12))) (< .cse9 .cse8) (let ((.cse10 (* 2 c_main_~n~0))) (< .cse10 (+ aux_mod_aux_mod_v_main_~x~0_127_32_125 (* (div .cse10 4294967296) 4294967296) 1))) (< .cse7 .cse6) (not (< (+ 2 c_main_~y~0) (+ .cse11 aux_mod_aux_mod_v_main_~x~0_127_32_125)))))))) (not (< 0 (mod c_main_~x~0 4294967296)))) (or (< (div (+ (* (- 1) c_main_~y~0) (- 4294967295)) (- 4294967296)) (+ 2 (div (+ c_main_~y~0 4294967293) 4294967296))) (< (div (+ (* (- 1) c_main_~x~0) (- 1)) (- 4294967296)) (+ (div (+ (- 1) c_main_~x~0) 4294967296) 2)) (let ((.cse14 (* 2 c_main_~n~0))) (let ((.cse13 (+ .cse14 (* (div (+ 2 c_main_~y~0) 4294967296) 4294967296))) (.cse12 (* (div .cse14 4294967296) 4294967296))) (and (<= (+ 2 c_main_~y~0 .cse12) .cse13) (< .cse13 (+ 3 c_main_~y~0 .cse12))))))) is different from false [2022-04-28 03:44:03,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {3713#false} assume !false; {3713#false} is VALID [2022-04-28 03:44:03,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {3802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3713#false} is VALID [2022-04-28 03:44:03,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:03,834 INFO L272 TraceCheckUtils]: 18: Hoare triple {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:03,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:03,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {3824#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3727#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:03,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {3828#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3824#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:44:03,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~y~0 % 4294967296 > 0); {3828#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 03:44:03,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {3835#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3828#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 03:44:03,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {3839#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3835#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:03,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {3843#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !(~z~0 % 4294967296 > 0); {3839#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-28 03:44:03,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {3847#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3843#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-28 03:44:03,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3847#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:03,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {3855#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} ~z~0 := ~y~0; {3851#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 03:44:03,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {3859#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3855#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} is VALID [2022-04-28 03:44:05,892 WARN L290 TraceCheckUtils]: 6: Hoare triple {3863#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_127_32_125) (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125 1)) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)))) (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (>= aux_mod_aux_mod_v_main_~x~0_127_32_125 4294967296) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* main_~n~0 2))))) (not (< 0 (mod main_~x~0 4294967296)))))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3859#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:44:07,906 WARN L290 TraceCheckUtils]: 5: Hoare triple {3712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3863#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_127_32_125) (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125 1)) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)))) (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (>= aux_mod_aux_mod_v_main_~x~0_127_32_125 4294967296) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* main_~n~0 2))))) (not (< 0 (mod main_~x~0 4294967296)))))} is UNKNOWN [2022-04-28 03:44:07,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {3712#true} call #t~ret13 := main(); {3712#true} is VALID [2022-04-28 03:44:07,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3712#true} {3712#true} #72#return; {3712#true} is VALID [2022-04-28 03:44:07,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {3712#true} assume true; {3712#true} is VALID [2022-04-28 03:44:07,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {3712#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(10, 2);call #Ultimate.allocInit(12, 3); {3712#true} is VALID [2022-04-28 03:44:07,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {3712#true} call ULTIMATE.init(); {3712#true} is VALID [2022-04-28 03:44:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092273488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:07,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:07,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2022-04-28 03:44:17,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:17,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046896537] [2022-04-28 03:44:17,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046896537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:17,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:44:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75751202] [2022-04-28 03:44:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:44:17,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:17,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:17,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:17,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:44:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:44:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1282, Unknown=32, NotChecked=74, Total=1560 [2022-04-28 03:44:17,903 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:21,644 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 03:44:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:44:21,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:44:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-28 03:44:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-28 03:44:21,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 41 transitions. [2022-04-28 03:44:21,786 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 03:44:21,787 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:44:21,787 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:44:21,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 115.6s TimeCoverageRelationStatistics Valid=244, Invalid=2177, Unknown=33, NotChecked=96, Total=2550 [2022-04-28 03:44:21,788 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:21,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2022-04-28 03:44:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:44:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-28 03:44:21,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:21,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,908 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,909 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:21,909 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-28 03:44:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 03:44:21,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:21,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:21,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:44:21,910 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:44:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:21,910 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-28 03:44:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 03:44:21,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:21,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:21,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:21,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 03:44:21,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 23 [2022-04-28 03:44:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:21,911 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 03:44:21,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 03:44:24,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 03:44:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:44:24,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:24,590 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:24,595 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 03:44:24,790 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,SelfDestructingSolverStorable14 [2022-04-28 03:44:24,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1748448584, now seen corresponding path program 7 times [2022-04-28 03:44:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268807683] [2022-04-28 03:44:24,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:24,962 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1431334722, now seen corresponding path program 1 times [2022-04-28 03:44:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:24,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618357890] [2022-04-28 03:44:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:24,971 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:24,995 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:25,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {4170#(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(10, 2);call #Ultimate.allocInit(12, 3); {4160#true} is VALID [2022-04-28 03:44:25,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {4160#true} assume true; {4160#true} is VALID [2022-04-28 03:44:25,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4160#true} {4160#true} #72#return; {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {4160#true} call ULTIMATE.init(); {4170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:25,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {4170#(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(10, 2);call #Ultimate.allocInit(12, 3); {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {4160#true} assume true; {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4160#true} {4160#true} #72#return; {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4160#true} call #t~ret13 := main(); {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4160#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4160#true} is VALID [2022-04-28 03:44:25,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {4160#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4160#true} is VALID [2022-04-28 03:44:25,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4160#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4165#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:25,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {4165#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4165#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:25,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {4165#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4166#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:25,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {4166#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4167#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {4167#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:25,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {4168#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4169#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:25,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {4169#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4161#false} is VALID [2022-04-28 03:44:25,065 INFO L272 TraceCheckUtils]: 18: Hoare triple {4161#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4161#false} is VALID [2022-04-28 03:44:25,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {4161#false} ~cond := #in~cond; {4161#false} is VALID [2022-04-28 03:44:25,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {4161#false} assume 0 == ~cond; {4161#false} is VALID [2022-04-28 03:44:25,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {4161#false} assume !false; {4161#false} is VALID [2022-04-28 03:44:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618357890] [2022-04-28 03:44:25,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618357890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783592660] [2022-04-28 03:44:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:25,067 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 03:44:25,068 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 03:44:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:25,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:25,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:25,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {4160#true} call ULTIMATE.init(); {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {4160#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(10, 2);call #Ultimate.allocInit(12, 3); {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {4160#true} assume true; {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4160#true} {4160#true} #72#return; {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {4160#true} call #t~ret13 := main(); {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {4160#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4160#true} is VALID [2022-04-28 03:44:25,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {4160#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4160#true} is VALID [2022-04-28 03:44:25,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {4160#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4160#true} is VALID [2022-04-28 03:44:25,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {4160#true} ~z~0 := ~y~0; {4198#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:25,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {4198#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4202#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:25,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {4202#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4206#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:44:25,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {4206#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:25,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:25,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4217#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:25,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4217#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4221#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:25,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {4221#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4161#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {4161#false} assume !(~x~0 % 4294967296 > 0); {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L272 TraceCheckUtils]: 18: Hoare triple {4161#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {4161#false} ~cond := #in~cond; {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {4161#false} assume 0 == ~cond; {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {4161#false} assume !false; {4161#false} is VALID [2022-04-28 03:44:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:25,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:25,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {4161#false} assume !false; {4161#false} is VALID [2022-04-28 03:44:25,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {4161#false} assume 0 == ~cond; {4161#false} is VALID [2022-04-28 03:44:25,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {4161#false} ~cond := #in~cond; {4161#false} is VALID [2022-04-28 03:44:25,348 INFO L272 TraceCheckUtils]: 18: Hoare triple {4161#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4161#false} is VALID [2022-04-28 03:44:25,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {4161#false} assume !(~x~0 % 4294967296 > 0); {4161#false} is VALID [2022-04-28 03:44:25,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {4161#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4161#false} is VALID [2022-04-28 03:44:25,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {4221#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4161#false} is VALID [2022-04-28 03:44:25,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {4217#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4221#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:25,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4217#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:25,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:25,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {4273#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4210#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:25,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {4277#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4273#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {4281#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4277#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:44:25,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {4160#true} ~z~0 := ~y~0; {4281#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:25,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {4160#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4160#true} is VALID [2022-04-28 03:44:25,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {4160#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {4160#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {4160#true} call #t~ret13 := main(); {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4160#true} {4160#true} #72#return; {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {4160#true} assume true; {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {4160#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(10, 2);call #Ultimate.allocInit(12, 3); {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {4160#true} call ULTIMATE.init(); {4160#true} is VALID [2022-04-28 03:44:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:25,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783592660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:25,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:25,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-04-28 03:44:25,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268807683] [2022-04-28 03:44:25,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268807683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:25,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:25,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:44:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192167262] [2022-04-28 03:44:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:44:25,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:25,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:25,476 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 03:44:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:44:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:44:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:44:25,477 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:26,182 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-28 03:44:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:44:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:44:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-28 03:44:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-28 03:44:26,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-28 03:44:26,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:26,247 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:44:26,247 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:44:26,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:44:26,248 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:26,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 35 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:44:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-04-28 03:44:26,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:26,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,381 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,381 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:26,382 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 03:44:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 03:44:26,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:26,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:26,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:44:26,382 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:44:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:26,383 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 03:44:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 03:44:26,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:26,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:26,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:26,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-28 03:44:26,384 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 23 [2022-04-28 03:44:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:26,384 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-28 03:44:26,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:26,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-28 03:44:26,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-28 03:44:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:44:26,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:26,934 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:26,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:27,134 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,SelfDestructingSolverStorable15 [2022-04-28 03:44:27,136 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -476532785, now seen corresponding path program 8 times [2022-04-28 03:44:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:27,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291548854] [2022-04-28 03:44:27,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:27,329 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash 998052933, now seen corresponding path program 1 times [2022-04-28 03:44:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:27,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755446992] [2022-04-28 03:44:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:27,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:27,353 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:27,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {4658#(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(10, 2);call #Ultimate.allocInit(12, 3); {4647#true} is VALID [2022-04-28 03:44:27,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {4647#true} assume true; {4647#true} is VALID [2022-04-28 03:44:27,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4647#true} {4647#true} #72#return; {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {4647#true} call ULTIMATE.init(); {4658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:27,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {4658#(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(10, 2);call #Ultimate.allocInit(12, 3); {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {4647#true} assume true; {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4647#true} {4647#true} #72#return; {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {4647#true} call #t~ret13 := main(); {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {4647#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4647#true} is VALID [2022-04-28 03:44:27,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {4647#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4647#true} is VALID [2022-04-28 03:44:27,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4647#true} is VALID [2022-04-28 03:44:27,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {4647#true} ~z~0 := ~y~0; {4652#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:27,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {4652#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4653#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:27,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {4653#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4654#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:27,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {4654#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4655#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:27,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {4655#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4648#false} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#false} assume !(~y~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:27,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {4648#false} assume !(~x~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:27,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {4648#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4648#false} is VALID [2022-04-28 03:44:27,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {4648#false} ~cond := #in~cond; {4648#false} is VALID [2022-04-28 03:44:27,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#false} assume 0 == ~cond; {4648#false} is VALID [2022-04-28 03:44:27,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {4648#false} assume !false; {4648#false} is VALID [2022-04-28 03:44:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755446992] [2022-04-28 03:44:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755446992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121035414] [2022-04-28 03:44:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:27,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:27,451 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 03:44:27,453 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 03:44:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:27,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:27,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:27,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {4647#true} call ULTIMATE.init(); {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {4647#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(10, 2);call #Ultimate.allocInit(12, 3); {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {4647#true} assume true; {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4647#true} {4647#true} #72#return; {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {4647#true} call #t~ret13 := main(); {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {4647#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {4647#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4647#true} is VALID [2022-04-28 03:44:27,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {4647#true} ~z~0 := ~y~0; {4652#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:27,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {4652#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4653#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:27,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {4653#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4654#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:27,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {4654#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4695#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:27,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#false} assume !(~y~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {4648#false} assume !(~x~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {4648#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4648#false} is VALID [2022-04-28 03:44:27,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {4648#false} ~cond := #in~cond; {4648#false} is VALID [2022-04-28 03:44:27,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#false} assume 0 == ~cond; {4648#false} is VALID [2022-04-28 03:44:27,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {4648#false} assume !false; {4648#false} is VALID [2022-04-28 03:44:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:27,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:28,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {4648#false} assume !false; {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#false} assume 0 == ~cond; {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {4648#false} ~cond := #in~cond; {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L272 TraceCheckUtils]: 19: Hoare triple {4648#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {4648#false} assume !(~x~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {4648#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4648#false} is VALID [2022-04-28 03:44:28,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#false} assume !(~y~0 % 4294967296 > 0); {4648#false} is VALID [2022-04-28 03:44:28,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4648#false} is VALID [2022-04-28 03:44:28,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4657#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:28,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4656#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:28,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4695#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:28,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {4766#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4762#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:28,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {4770#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4766#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {4647#true} ~z~0 := ~y~0; {4770#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {4647#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {4647#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {4647#true} call #t~ret13 := main(); {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4647#true} {4647#true} #72#return; {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {4647#true} assume true; {4647#true} is VALID [2022-04-28 03:44:28,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {4647#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(10, 2);call #Ultimate.allocInit(12, 3); {4647#true} is VALID [2022-04-28 03:44:28,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {4647#true} call ULTIMATE.init(); {4647#true} is VALID [2022-04-28 03:44:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121035414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:28,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:28,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-28 03:44:28,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291548854] [2022-04-28 03:44:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291548854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:28,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:28,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:44:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694984769] [2022-04-28 03:44:28,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:44:28,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:28,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:28,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:44:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:44:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:44:28,290 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:28,978 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 03:44:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:44:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:44:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:44:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:44:28,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 03:44:29,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:29,017 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:44:29,017 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:44:29,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:44:29,019 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:29,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:44:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-28 03:44:29,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:29,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,139 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,139 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:29,139 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 03:44:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 03:44:29,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:29,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:44:29,140 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:44:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:29,140 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 03:44:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 03:44:29,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:29,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:29,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:29,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 03:44:29,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2022-04-28 03:44:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 03:44:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-28 03:44:30,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 03:44:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:44:30,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:30,571 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:30,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:30,771 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,SelfDestructingSolverStorable16 [2022-04-28 03:44:30,771 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1165944096, now seen corresponding path program 9 times [2022-04-28 03:44:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:30,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1803588245] [2022-04-28 03:44:30,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:30,957 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 31113558, now seen corresponding path program 1 times [2022-04-28 03:44:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817246114] [2022-04-28 03:44:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:30,966 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:30,974 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:31,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {5095#(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(10, 2);call #Ultimate.allocInit(12, 3); {5084#true} is VALID [2022-04-28 03:44:31,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#true} assume true; {5084#true} is VALID [2022-04-28 03:44:31,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5084#true} {5084#true} #72#return; {5084#true} is VALID [2022-04-28 03:44:31,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {5084#true} call ULTIMATE.init(); {5095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:31,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {5095#(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(10, 2);call #Ultimate.allocInit(12, 3); {5084#true} is VALID [2022-04-28 03:44:31,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {5084#true} assume true; {5084#true} is VALID [2022-04-28 03:44:31,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5084#true} {5084#true} #72#return; {5084#true} is VALID [2022-04-28 03:44:31,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {5084#true} call #t~ret13 := main(); {5084#true} is VALID [2022-04-28 03:44:31,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {5084#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5084#true} is VALID [2022-04-28 03:44:31,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {5084#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5084#true} is VALID [2022-04-28 03:44:31,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {5084#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5089#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:31,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {5089#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5089#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:31,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {5089#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5090#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:31,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {5090#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5091#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {5091#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5092#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {5092#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:31,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {5093#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5094#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:31,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {5094#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5085#false} is VALID [2022-04-28 03:44:31,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {5085#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5085#false} is VALID [2022-04-28 03:44:31,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {5085#false} ~cond := #in~cond; {5085#false} is VALID [2022-04-28 03:44:31,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {5085#false} assume 0 == ~cond; {5085#false} is VALID [2022-04-28 03:44:31,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {5085#false} assume !false; {5085#false} is VALID [2022-04-28 03:44:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:31,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817246114] [2022-04-28 03:44:31,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817246114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:31,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684291904] [2022-04-28 03:44:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:31,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:31,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:31,080 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 03:44:31,081 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 03:44:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:31,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:31,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {5084#true} call ULTIMATE.init(); {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#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(10, 2);call #Ultimate.allocInit(12, 3); {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {5084#true} assume true; {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5084#true} {5084#true} #72#return; {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {5084#true} call #t~ret13 := main(); {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {5084#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5084#true} is VALID [2022-04-28 03:44:31,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {5084#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5084#true} is VALID [2022-04-28 03:44:31,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {5084#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-28 03:44:31,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {5084#true} ~z~0 := ~y~0; {5123#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:31,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {5123#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5127#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:31,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {5127#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5131#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:44:31,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {5131#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:31,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {5145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5149#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:31,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {5149#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5085#false} is VALID [2022-04-28 03:44:31,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {5085#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5085#false} is VALID [2022-04-28 03:44:31,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {5085#false} assume !(~x~0 % 4294967296 > 0); {5085#false} is VALID [2022-04-28 03:44:31,248 INFO L272 TraceCheckUtils]: 19: Hoare triple {5085#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5085#false} is VALID [2022-04-28 03:44:31,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {5085#false} ~cond := #in~cond; {5085#false} is VALID [2022-04-28 03:44:31,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {5085#false} assume 0 == ~cond; {5085#false} is VALID [2022-04-28 03:44:31,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {5085#false} assume !false; {5085#false} is VALID [2022-04-28 03:44:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:31,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:31,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {5085#false} assume !false; {5085#false} is VALID [2022-04-28 03:44:31,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {5085#false} assume 0 == ~cond; {5085#false} is VALID [2022-04-28 03:44:31,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {5085#false} ~cond := #in~cond; {5085#false} is VALID [2022-04-28 03:44:31,395 INFO L272 TraceCheckUtils]: 19: Hoare triple {5085#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5085#false} is VALID [2022-04-28 03:44:31,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {5085#false} assume !(~x~0 % 4294967296 > 0); {5085#false} is VALID [2022-04-28 03:44:31,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {5085#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5085#false} is VALID [2022-04-28 03:44:31,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {5149#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5085#false} is VALID [2022-04-28 03:44:31,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {5145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5149#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:31,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:31,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:31,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {5208#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5204#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:31,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {5212#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5208#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:44:31,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {5084#true} ~z~0 := ~y~0; {5212#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:31,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {5084#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {5084#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {5084#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {5084#true} call #t~ret13 := main(); {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5084#true} {5084#true} #72#return; {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {5084#true} assume true; {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#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(10, 2);call #Ultimate.allocInit(12, 3); {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {5084#true} call ULTIMATE.init(); {5084#true} is VALID [2022-04-28 03:44:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:31,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684291904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:31,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:31,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:44:31,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1803588245] [2022-04-28 03:44:31,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1803588245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:31,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:44:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515055620] [2022-04-28 03:44:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:44:31,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:31,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:31,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:31,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:44:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:44:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:44:31,521 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:32,347 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-28 03:44:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:44:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:44:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-28 03:44:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-28 03:44:32,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 67 transitions. [2022-04-28 03:44:32,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:32,451 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:44:32,452 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:44:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:44:32,452 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:32,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 35 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:44:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-04-28 03:44:32,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:32,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,596 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,596 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:32,597 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-28 03:44:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-28 03:44:32,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:32,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:32,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:44:32,597 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:44:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:32,598 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-28 03:44:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-28 03:44:32,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:32,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:32,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:32,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-04-28 03:44:32,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 24 [2022-04-28 03:44:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:32,599 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-04-28 03:44:32,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:32,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 54 transitions. [2022-04-28 03:44:33,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 03:44:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:44:33,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:33,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:33,537 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 03:44:33,723 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,SelfDestructingSolverStorable17 [2022-04-28 03:44:33,724 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 176966584, now seen corresponding path program 10 times [2022-04-28 03:44:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:33,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2064895427] [2022-04-28 03:44:37,812 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:37,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:37,884 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 69432962, now seen corresponding path program 1 times [2022-04-28 03:44:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981656578] [2022-04-28 03:44:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:37,894 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:37,905 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:37,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {5601#(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(10, 2);call #Ultimate.allocInit(12, 3); {5590#true} is VALID [2022-04-28 03:44:37,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {5590#true} assume true; {5590#true} is VALID [2022-04-28 03:44:37,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5590#true} {5590#true} #72#return; {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {5590#true} call ULTIMATE.init(); {5601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {5601#(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(10, 2);call #Ultimate.allocInit(12, 3); {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#true} assume true; {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#true} {5590#true} #72#return; {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#true} call #t~ret13 := main(); {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {5590#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5590#true} is VALID [2022-04-28 03:44:37,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#true} ~z~0 := ~y~0; {5595#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:37,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {5595#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5596#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:37,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {5596#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5597#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:37,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {5597#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:37,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:37,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:37,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {5591#false} assume !(~x~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L272 TraceCheckUtils]: 20: Hoare triple {5591#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {5591#false} ~cond := #in~cond; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {5591#false} assume 0 == ~cond; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {5591#false} assume !false; {5591#false} is VALID [2022-04-28 03:44:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981656578] [2022-04-28 03:44:37,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981656578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:37,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303445871] [2022-04-28 03:44:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:38,008 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 03:44:38,010 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 03:44:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:38,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {5590#true} call ULTIMATE.init(); {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5590#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(10, 2);call #Ultimate.allocInit(12, 3); {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#true} assume true; {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#true} {5590#true} #72#return; {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#true} call #t~ret13 := main(); {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {5590#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5590#true} is VALID [2022-04-28 03:44:38,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5590#true} is VALID [2022-04-28 03:44:38,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#true} ~z~0 := ~y~0; {5595#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:38,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {5595#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5596#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:38,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {5596#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5597#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:38,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {5597#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:38,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:38,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:38,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:38,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {5591#false} assume !(~x~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L272 TraceCheckUtils]: 20: Hoare triple {5591#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {5591#false} ~cond := #in~cond; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {5591#false} assume 0 == ~cond; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {5591#false} assume !false; {5591#false} is VALID [2022-04-28 03:44:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:38,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:38,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {5591#false} assume !false; {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {5591#false} assume 0 == ~cond; {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {5591#false} ~cond := #in~cond; {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L272 TraceCheckUtils]: 20: Hoare triple {5591#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {5591#false} assume !(~x~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {5591#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5591#false} is VALID [2022-04-28 03:44:38,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5591#false} is VALID [2022-04-28 03:44:38,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5600#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:38,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5599#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:38,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:38,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {5710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5598#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:38,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {5714#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:38,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {5718#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5714#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-28 03:44:38,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#true} ~z~0 := ~y~0; {5718#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:38,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5590#true} is VALID [2022-04-28 03:44:38,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {5590#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5590#true} is VALID [2022-04-28 03:44:38,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5590#true} is VALID [2022-04-28 03:44:38,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#true} call #t~ret13 := main(); {5590#true} is VALID [2022-04-28 03:44:38,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#true} {5590#true} #72#return; {5590#true} is VALID [2022-04-28 03:44:38,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#true} assume true; {5590#true} is VALID [2022-04-28 03:44:38,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {5590#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(10, 2);call #Ultimate.allocInit(12, 3); {5590#true} is VALID [2022-04-28 03:44:38,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {5590#true} call ULTIMATE.init(); {5590#true} is VALID [2022-04-28 03:44:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:38,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303445871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:38,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:38,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:44:38,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2064895427] [2022-04-28 03:44:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2064895427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:38,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:44:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395924268] [2022-04-28 03:44:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:44:38,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:38,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:38,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:44:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:44:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:44:38,709 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:39,528 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 03:44:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:44:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:44:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2022-04-28 03:44:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2022-04-28 03:44:39,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 38 transitions. [2022-04-28 03:44:39,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:39,586 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:44:39,586 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:44:39,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:44:39,587 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:39,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:44:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-04-28 03:44:39,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:39,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,757 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,757 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:39,758 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 03:44:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 03:44:39,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:39,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:39,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:44:39,758 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:44:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:39,759 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 03:44:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 03:44:39,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:39,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:39,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:39,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 03:44:39,760 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 25 [2022-04-28 03:44:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:39,760 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 03:44:39,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 03:44:40,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 03:44:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:44:40,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:40,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:40,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:40,621 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1440430863, now seen corresponding path program 11 times [2022-04-28 03:44:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664432435] [2022-04-28 03:44:40,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:40,798 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 132872999, now seen corresponding path program 1 times [2022-04-28 03:44:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359407835] [2022-04-28 03:44:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:40,807 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:40,840 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:41,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {6117#(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(10, 2);call #Ultimate.allocInit(12, 3); {6096#true} is VALID [2022-04-28 03:44:41,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {6096#true} assume true; {6096#true} is VALID [2022-04-28 03:44:41,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6096#true} {6096#true} #72#return; {6096#true} is VALID [2022-04-28 03:44:41,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {6096#true} call ULTIMATE.init(); {6117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:41,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {6117#(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(10, 2);call #Ultimate.allocInit(12, 3); {6096#true} is VALID [2022-04-28 03:44:41,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {6096#true} assume true; {6096#true} is VALID [2022-04-28 03:44:41,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6096#true} {6096#true} #72#return; {6096#true} is VALID [2022-04-28 03:44:41,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {6096#true} call #t~ret13 := main(); {6096#true} is VALID [2022-04-28 03:44:41,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {6096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:44:41,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {6101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [108] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_184 4294967296)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_184 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_152 v_it_17 1) v_main_~y~0_151)) (not (<= 1 v_it_17)))) (= v_main_~x~0_183 (+ v_main_~x~0_184 v_main_~y~0_152 (* (- 1) v_main_~y~0_151))) (< 0 .cse2) (< v_main_~y~0_152 v_main_~y~0_151)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_152, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_184, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_151, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_183, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6102#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:44:41,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {6102#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6103#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:44:41,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {6103#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {6104#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:44:41,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {6104#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6105#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:44:41,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {6105#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6106#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ 4294967293 (* (div (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:43,744 WARN L290 TraceCheckUtils]: 11: Hoare triple {6106#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ 4294967293 (* (div (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6107#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483644 (* (div main_~z~0 4294967296) 4294967296) (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648) 4294967296) main_~z~0))} is UNKNOWN [2022-04-28 03:44:43,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {6107#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483644 (* (div main_~z~0 4294967296) 4294967296) (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6108#(<= (* 4294967296 (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648)) main_~z~0)} is VALID [2022-04-28 03:44:43,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {6108#(<= (* 4294967296 (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6109#(<= (+ (* 4294967296 (div (+ (* (- 2147483648) (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 2) main_~n~0) 2147483648)) main_~n~0 2147483644) 2147483648)) 1) main_~z~0)} is VALID [2022-04-28 03:44:43,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {6109#(<= (+ (* 4294967296 (div (+ (* (- 2147483648) (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 2) main_~n~0) 2147483648)) main_~n~0 2147483644) 2147483648)) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6110#(<= (+ 2 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:43,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {6110#(<= (+ 2 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6111#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:43,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {6111#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6111#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:43,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {6111#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6112#(<= (+ (* (div (+ main_~n~0 (* (- 2147483648) (div (+ (* (- 1) (div (+ (- 1) main_~z~0) 2)) (- 2) main_~n~0) 2147483648)) 2147483644) 2147483648) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:44:43,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {6112#(<= (+ (* (div (+ main_~n~0 (* (- 2147483648) (div (+ (* (- 1) (div (+ (- 1) main_~z~0) 2)) (- 2) main_~n~0) 2147483648)) 2147483644) 2147483648) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6113#(<= (+ 5 (* 4294967296 (div (+ (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ (- 2) main_~z~0) 2))) 2147483648)) main_~n~0 2147483644) 2147483648))) main_~z~0)} is VALID [2022-04-28 03:44:43,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(<= (+ 5 (* 4294967296 (div (+ (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ (- 2) main_~z~0) 2))) 2147483648)) main_~n~0 2147483644) 2147483648))) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:43,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {6114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {6114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:43,783 INFO L272 TraceCheckUtils]: 21: Hoare triple {6114#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:43,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {6115#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6116#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:43,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {6116#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6097#false} is VALID [2022-04-28 03:44:43,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {6097#false} assume !false; {6097#false} is VALID [2022-04-28 03:44:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:43,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359407835] [2022-04-28 03:44:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359407835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:43,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11257083] [2022-04-28 03:44:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:43,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:43,786 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 03:44:43,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process