/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:08:30,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:08:30,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:08:30,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:08:30,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:08:30,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:08:30,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:08:30,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:08:30,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:08:30,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:08:30,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:08:30,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:08:30,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:08:30,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:08:30,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:08:30,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:08:30,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:08:30,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:08:30,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:08:30,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:08:30,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:08:30,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:08:30,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:08:30,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:08:30,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:08:30,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:08:30,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:08:30,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:08:30,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:08:30,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:08:30,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:08:30,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:08:30,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:08:30,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:08:30,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:08:30,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:08:30,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:08:30,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:08:30,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:08:30,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:08:30,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:08:30,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:08:30,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:08:30,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:08:30,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:08:30,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:08:30,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:08:30,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:08:30,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:08:30,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:08:30,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:08:30,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:08:30,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:08:30,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:08:30,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:30,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:08:30,619 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:08:30,619 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 10:08:30,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:08:30,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:08:30,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:08:30,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:08:30,799 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:08:30,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-28 10:08:30,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515b8ae94/d0c98ac505874fee8cfd265126bd1d5d/FLAG2d0046730 [2022-04-28 10:08:31,173 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:08:31,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-28 10:08:31,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515b8ae94/d0c98ac505874fee8cfd265126bd1d5d/FLAG2d0046730 [2022-04-28 10:08:31,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515b8ae94/d0c98ac505874fee8cfd265126bd1d5d [2022-04-28 10:08:31,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:08:31,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:08:31,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:31,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:08:31,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:08:31,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359287db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31, skipping insertion in model container [2022-04-28 10:08:31,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:08:31,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:08:31,321 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-de52.c[368,381] [2022-04-28 10:08:31,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:31,344 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:08:31,351 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-de52.c[368,381] [2022-04-28 10:08:31,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:31,361 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:08:31,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31 WrapperNode [2022-04-28 10:08:31,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:31,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:08:31,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:08:31,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:08:31,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:08:31,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:08:31,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:08:31,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:08:31,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (1/1) ... [2022-04-28 10:08:31,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:31,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:31,422 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 10:08:31,428 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 10:08:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:08:31,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:08:31,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:08:31,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:08:31,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:08:31,451 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:08:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:08:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:08:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:08:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:08:31,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:08:31,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:08:31,678 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:08:31,682 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:08:31,682 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 10:08:31,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:31 BoogieIcfgContainer [2022-04-28 10:08:31,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:08:31,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:08:31,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:08:31,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:08:31,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:08:31" (1/3) ... [2022-04-28 10:08:31,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ede476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:31, skipping insertion in model container [2022-04-28 10:08:31,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:31" (2/3) ... [2022-04-28 10:08:31,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ede476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:31, skipping insertion in model container [2022-04-28 10:08:31,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:31" (3/3) ... [2022-04-28 10:08:31,689 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-28 10:08:31,697 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:08:31,698 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:08:31,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:08:31,731 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@15a65b22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1131cd29 [2022-04-28 10:08:31,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:08:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 10:08:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:08:31,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:31,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:31,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-28 10:08:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:31,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899541963] [2022-04-28 10:08:31,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-28 10:08:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:31,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233822612] [2022-04-28 10:08:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:31,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 10:08:31,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:08:31,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 10:08:31,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:31,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 10:08:31,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:08:31,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 10:08:31,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-28 10:08:31,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-28 10:08:31,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:31,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-28 10:08:31,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:31,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:31,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 10:08:31,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-28 10:08:31,908 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 10:08:31,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 10:08:31,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 10:08:31,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 10:08:31,910 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 10:08:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233822612] [2022-04-28 10:08:31,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233822612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:31,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:31,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899541963] [2022-04-28 10:08:31,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899541963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:31,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:31,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68287417] [2022-04-28 10:08:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:31,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:31,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:31,944 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 10:08:31,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:08:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:08:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:31,960 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 4.0) internal successors, (12), 2 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 10:08:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,036 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-28 10:08:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:08:32,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 10:08:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 10:08:32,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-28 10:08:32,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:32,101 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:08:32,101 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:08:32,103 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 10:08:32,105 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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 10:08:32,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:08:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:08:32,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:32,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 10:08:32,133 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 10:08:32,133 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 10:08:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,135 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 10:08:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:32,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 17 states. [2022-04-28 10:08:32,136 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 17 states. [2022-04-28 10:08:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,137 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 10:08:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:32,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:32,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 10:08:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-28 10:08:32,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-28 10:08:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:32,141 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-28 10:08:32,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 10:08:32,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-28 10:08:32,162 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 10:08:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:08:32,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:32,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:32,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:08:32,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-28 10:08:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383859491] [2022-04-28 10:08:32,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-28 10:08:32,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:32,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114043107] [2022-04-28 10:08:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(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); {185#true} is VALID [2022-04-28 10:08:32,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 10:08:32,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 10:08:32,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:32,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(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); {185#true} is VALID [2022-04-28 10:08:32,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 10:08:32,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 10:08:32,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-28 10:08:32,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185#true} is VALID [2022-04-28 10:08:32,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-28 10:08:32,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-28 10:08:32,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-28 10:08:32,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(~y~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 10:08:32,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 10:08:32,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 10:08:32,310 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:32,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:32,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-28 10:08:32,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-28 10:08:32,312 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 10:08:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114043107] [2022-04-28 10:08:32,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114043107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:32,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383859491] [2022-04-28 10:08:32,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383859491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169747363] [2022-04-28 10:08:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:32,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,329 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 10:08:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:08:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:08:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:08:32,331 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,499 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 10:08:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:08:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 10:08:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 10:08:32,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 10:08:32,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:32,547 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:08:32,547 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:08:32,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:32,549 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:32,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:08:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:08:32,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:32,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 10:08:32,563 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 10:08:32,563 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 10:08:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,565 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-28 10:08:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 10:08:32,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 23 states. [2022-04-28 10:08:32,566 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 23 states. [2022-04-28 10:08:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,568 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-28 10:08:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 10:08:32,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:32,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 10:08:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-28 10:08:32,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-28 10:08:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:32,572 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-28 10:08:32,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:08:32,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-28 10:08:32,596 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 10:08:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 10:08:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:32,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:32,597 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 10:08:32,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:08:32,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-28 10:08:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437326878] [2022-04-28 10:08:32,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-28 10:08:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:32,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394966367] [2022-04-28 10:08:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(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); {363#true} is VALID [2022-04-28 10:08:32,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 10:08:32,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-28 10:08:32,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:32,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(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); {363#true} is VALID [2022-04-28 10:08:32,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 10:08:32,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-28 10:08:32,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-28 10:08:32,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {363#true} is VALID [2022-04-28 10:08:32,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-28 10:08:32,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-28 10:08:32,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~z~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:32,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:32,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:32,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {364#false} is VALID [2022-04-28 10:08:32,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-28 10:08:32,685 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {364#false} is VALID [2022-04-28 10:08:32,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-28 10:08:32,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-28 10:08:32,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-28 10:08:32,685 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 10:08:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:32,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394966367] [2022-04-28 10:08:32,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394966367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:32,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:32,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437326878] [2022-04-28 10:08:32,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437326878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249340367] [2022-04-28 10:08:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:32,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,703 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 10:08:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:08:32,704 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,777 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 10:08:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 10:08:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 10:08:32,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-28 10:08:32,807 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 10:08:32,808 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:08:32,808 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:08:32,808 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 10:08:32,809 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 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 10:08:32,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:08:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 10:08:32,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:32,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 10:08:32,820 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 10:08:32,820 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 10:08:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,821 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 10:08:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 10:08:32,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 27 states. [2022-04-28 10:08:32,822 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 27 states. [2022-04-28 10:08:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,823 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 10:08:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 10:08:32,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:32,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:32,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:32,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 10:08:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-28 10:08:32,825 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-28 10:08:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:32,825 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-28 10:08:32,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-28 10:08:32,866 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 10:08:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 10:08:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:32,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:32,867 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 10:08:32,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:08:32,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-28 10:08:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145316898] [2022-04-28 10:08:32,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-28 10:08:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:32,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167128292] [2022-04-28 10:08:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(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); {550#true} is VALID [2022-04-28 10:08:32,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-28 10:08:32,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-28 10:08:32,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:32,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(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); {550#true} is VALID [2022-04-28 10:08:32,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-28 10:08:32,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-28 10:08:32,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-28 10:08:32,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {550#true} is VALID [2022-04-28 10:08:32,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#true} assume !(~x~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:32,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:32,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:32,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:32,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {551#false} is VALID [2022-04-28 10:08:32,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-28 10:08:32,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-28 10:08:32,904 INFO L272 TraceCheckUtils]: 13: Hoare triple {551#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {551#false} is VALID [2022-04-28 10:08:32,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-28 10:08:32,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-28 10:08:32,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-28 10:08:32,905 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 10:08:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167128292] [2022-04-28 10:08:32,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167128292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:32,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145316898] [2022-04-28 10:08:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145316898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141527754] [2022-04-28 10:08:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:32,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:32,917 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 10:08:32,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:08:32,918 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,005 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-28 10:08:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-28 10:08:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-28 10:08:33,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-28 10:08:33,040 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 10:08:33,041 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:08:33,041 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:08:33,041 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 10:08:33,042 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:33,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:08:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:08:33,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:33,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 10:08:33,060 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 10:08:33,061 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 10:08:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,062 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 10:08:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:08:33,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 32 states. [2022-04-28 10:08:33,062 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 32 states. [2022-04-28 10:08:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,063 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 10:08:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:08:33,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:33,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 10:08:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-28 10:08:33,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-28 10:08:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:33,065 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-28 10:08:33,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 10:08:33,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-28 10:08:33,101 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 10:08:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:08:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:08:33,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:33,102 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 10:08:33,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:08:33,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-28 10:08:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69361345] [2022-04-28 10:08:33,113 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:33,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 2 times [2022-04-28 10:08:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:33,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400285078] [2022-04-28 10:08:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(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); {775#true} is VALID [2022-04-28 10:08:33,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-28 10:08:33,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-28 10:08:33,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:33,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#(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); {775#true} is VALID [2022-04-28 10:08:33,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-28 10:08:33,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-28 10:08:33,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-28 10:08:33,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {780#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {780#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(= main_~y~0 0)} ~z~0 := ~y~0; {781#(= main_~z~0 0)} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= 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; {776#false} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#false} assume !(~y~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {776#false} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#false} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 10:08:33,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 10:08:33,158 INFO L272 TraceCheckUtils]: 14: Hoare triple {776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {776#false} is VALID [2022-04-28 10:08:33,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-28 10:08:33,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-28 10:08:33,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-28 10:08:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:33,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400285078] [2022-04-28 10:08:33,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400285078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:33,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:33,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:33,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:33,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69361345] [2022-04-28 10:08:33,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69361345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:33,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:33,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904978250] [2022-04-28 10:08:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:33,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,171 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 10:08:33,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:33,172 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,258 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 10:08:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 10:08:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 10:08:33,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 10:08:33,283 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 10:08:33,284 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:08:33,284 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:08:33,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:08:33,285 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:33,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:08:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:08:33,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:33,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,299 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,300 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,300 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-28 10:08:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 10:08:33,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,301 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,302 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-28 10:08:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 10:08:33,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:33,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 10:08:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-28 10:08:33,303 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-04-28 10:08:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:33,304 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-28 10:08:33,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 10:08:33,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-28 10:08:33,334 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 10:08:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 10:08:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:08:33,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:33,334 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 10:08:33,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 10:08:33,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-28 10:08:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835182805] [2022-04-28 10:08:33,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:33,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 2 times [2022-04-28 10:08:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:33,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000935107] [2022-04-28 10:08:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(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); {981#true} is VALID [2022-04-28 10:08:33,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-28 10:08:33,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-28 10:08:33,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:33,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(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); {981#true} is VALID [2022-04-28 10:08:33,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-28 10:08:33,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-28 10:08:33,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-28 10:08:33,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {986#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {988#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:33,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {988#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {982#false} 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; {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {982#false} assume !(~y~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {982#false} assume !(~x~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {982#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {982#false} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,404 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-28 10:08:33,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-28 10:08:33,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-28 10:08:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000935107] [2022-04-28 10:08:33,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000935107] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743834046] [2022-04-28 10:08:33,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:33,407 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 10:08:33,408 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 10:08:33,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:33,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:33,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:08:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:33,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2022-04-28 10:08:33,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#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); {981#true} is VALID [2022-04-28 10:08:33,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-28 10:08:33,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-28 10:08:33,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-28 10:08:33,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {986#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~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; {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:33,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:33,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:33,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1034#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:33,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1034#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,805 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-28 10:08:33,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-28 10:08:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-28 10:08:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-28 10:08:33,806 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 10:08:33,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:33,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-28 10:08:33,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-28 10:08:33,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-28 10:08:33,917 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-28 10:08:33,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-28 10:08:33,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1062#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:33,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:33,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:33,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~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; {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:33,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:33,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#true} ~z~0 := ~y~0; {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:33,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#true} assume !(~x~0 % 4294967296 > 0); {981#true} is VALID [2022-04-28 10:08:33,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {981#true} is VALID [2022-04-28 10:08:33,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {981#true} is VALID [2022-04-28 10:08:33,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-28 10:08:33,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-28 10:08:33,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-28 10:08:33,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#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); {981#true} is VALID [2022-04-28 10:08:33,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2022-04-28 10:08:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:33,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743834046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:33,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:33,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-04-28 10:08:33,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835182805] [2022-04-28 10:08:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835182805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:33,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:33,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762155101] [2022-04-28 10:08:33,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:33,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:33,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:33,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:33,934 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 10:08:33,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:08:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:08:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:08:33,935 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:34,141 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-28 10:08:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:08:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:08:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:08:34,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-28 10:08:34,183 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 10:08:34,184 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:08:34,184 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:08:34,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:08:34,184 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:34,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 36 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:08:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-28 10:08:34,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:34,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,208 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,209 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:34,210 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 10:08:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-28 10:08:34,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:34,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:34,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,210 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:34,211 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 10:08:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-28 10:08:34,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:34,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:34,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:34,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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 10:08:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-28 10:08:34,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2022-04-28 10:08:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:34,213 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-28 10:08:34,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 10:08:34,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-28 10:08:34,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 10:08:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:34,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:34,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:34,270 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 10:08:34,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 10:08:34,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-28 10:08:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:34,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288475102] [2022-04-28 10:08:34,465 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:34,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 2 times [2022-04-28 10:08:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:34,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533589887] [2022-04-28 10:08:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {1386#(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); {1379#true} is VALID [2022-04-28 10:08:34,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 10:08:34,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-28 10:08:34,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:34,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#(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); {1379#true} is VALID [2022-04-28 10:08:34,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 10:08:34,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-28 10:08:34,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-28 10:08:34,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-28 10:08:34,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:34,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-28 10:08:34,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:34,549 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-28 10:08:34,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 10:08:34,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 10:08:34,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 10:08:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533589887] [2022-04-28 10:08:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533589887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988599815] [2022-04-28 10:08:34,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:34,551 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 10:08:34,552 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 10:08:34,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:34,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:34,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:08:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:34,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-28 10:08:34,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#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); {1379#true} is VALID [2022-04-28 10:08:34,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 10:08:34,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-28 10:08:34,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-28 10:08:34,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-28 10:08:34,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:34,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:34,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:34,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-28 10:08:34,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:34,822 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-28 10:08:34,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 10:08:34,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 10:08:34,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 10:08:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:34,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:35,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 10:08:35,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 10:08:35,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 10:08:35,033 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-28 10:08:35,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:35,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-28 10:08:35,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-28 10:08:35,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:35,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:35,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:35,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 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; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:35,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:35,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:35,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:35,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#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); {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-28 10:08:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:35,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988599815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:35,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:35,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:08:35,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:35,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288475102] [2022-04-28 10:08:35,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288475102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:35,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:35,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446062335] [2022-04-28 10:08:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:35,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,054 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 10:08:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:35,055 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:35,193 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 10:08:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:35,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 10:08:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 10:08:35,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 10:08:35,228 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 10:08:35,228 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:08:35,228 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:08:35,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:08:35,229 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:35,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:08:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 10:08:35,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:35,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 10:08:35,266 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 10:08:35,266 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 10:08:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:35,268 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-04-28 10:08:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-28 10:08:35,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:35,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:35,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 42 states. [2022-04-28 10:08:35,268 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 42 states. [2022-04-28 10:08:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:35,269 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-04-28 10:08:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-28 10:08:35,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:35,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:35,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:35,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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 10:08:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-04-28 10:08:35,271 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 20 [2022-04-28 10:08:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:35,271 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-04-28 10:08:35,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 10:08:35,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 56 transitions. [2022-04-28 10:08:35,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-28 10:08:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:35,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:35,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:35,349 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 10:08:35,530 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,SelfDestructingSolverStorable6 [2022-04-28 10:08:35,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:35,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-28 10:08:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:35,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509652406] [2022-04-28 10:08:35,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:35,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 2 times [2022-04-28 10:08:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:35,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801220702] [2022-04-28 10:08:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {1784#(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); {1774#true} is VALID [2022-04-28 10:08:35,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-28 10:08:35,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-28 10:08:35,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:35,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1784#(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); {1774#true} is VALID [2022-04-28 10:08:35,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-28 10:08:35,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-28 10:08:35,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-28 10:08:35,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1779#(= main_~y~0 0)} is VALID [2022-04-28 10:08:35,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:35,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(and (<= main_~z~0 1) (<= 1 main_~z~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; {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:35,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:35,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1782#(and (<= main_~z~0 0) (<= 0 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; {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:35,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:35,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:35,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:35,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1775#false} is VALID [2022-04-28 10:08:35,627 INFO L272 TraceCheckUtils]: 16: Hoare triple {1775#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1775#false} is VALID [2022-04-28 10:08:35,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-28 10:08:35,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-28 10:08:35,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-28 10:08:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801220702] [2022-04-28 10:08:35,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801220702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333054841] [2022-04-28 10:08:35,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:35,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:35,633 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 10:08:35,637 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 10:08:35,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:35,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:35,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:08:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:35,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:35,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-28 10:08:35,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#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); {1774#true} is VALID [2022-04-28 10:08:35,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-28 10:08:35,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-28 10:08:35,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-28 10:08:35,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1779#(= main_~y~0 0)} is VALID [2022-04-28 10:08:35,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~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; {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~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; {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} is VALID [2022-04-28 10:08:35,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} is VALID [2022-04-28 10:08:35,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:35,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1775#false} is VALID [2022-04-28 10:08:35,824 INFO L272 TraceCheckUtils]: 16: Hoare triple {1775#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1775#false} is VALID [2022-04-28 10:08:35,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-28 10:08:35,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-28 10:08:35,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-28 10:08:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:35,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:36,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-28 10:08:36,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {1851#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1775#false} is VALID [2022-04-28 10:08:36,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1851#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:36,004 INFO L272 TraceCheckUtils]: 16: Hoare triple {1859#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1855#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:36,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1859#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:36,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:36,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:36,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-28 10:08:36,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~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; {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-28 10:08:36,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:08:36,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 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; {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:08:36,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} ~z~0 := ~y~0; {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:36,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} assume !(~x~0 % 4294967296 > 0); {1774#true} is VALID [2022-04-28 10:08:36,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {1774#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1774#true} is VALID [2022-04-28 10:08:36,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1774#true} is VALID [2022-04-28 10:08:36,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-28 10:08:36,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-28 10:08:36,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-28 10:08:36,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#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); {1774#true} is VALID [2022-04-28 10:08:36,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-28 10:08:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333054841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:36,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2022-04-28 10:08:36,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509652406] [2022-04-28 10:08:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509652406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181713521] [2022-04-28 10:08:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:36,011 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 10:08:36,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:36,011 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 10:08:36,025 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 10:08:36,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:08:36,026 INFO L87 Difference]: Start difference. First operand 41 states and 56 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 10:08:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,374 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-04-28 10:08:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:36,374 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 10:08:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:36,374 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 10:08:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-28 10:08:36,376 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 10:08:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-28 10:08:36,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 57 transitions. [2022-04-28 10:08:36,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:36,428 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:08:36,428 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:08:36,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:08:36,430 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:36,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:08:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-28 10:08:36,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:36,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 10:08:36,484 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 10:08:36,485 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 10:08:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,486 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 10:08:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-28 10:08:36,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 47 states. [2022-04-28 10:08:36,487 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 47 states. [2022-04-28 10:08:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,488 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 10:08:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-28 10:08:36,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:36,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 10:08:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 10:08:36,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 20 [2022-04-28 10:08:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:36,490 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2022-04-28 10:08:36,491 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 10:08:36,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-28 10:08:36,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-28 10:08:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:36,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:36,558 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 10:08:36,595 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 10:08:36,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:36,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2026119006, now seen corresponding path program 3 times [2022-04-28 10:08:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286218107] [2022-04-28 10:08:36,762 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:36,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2026119006, now seen corresponding path program 4 times [2022-04-28 10:08:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:36,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406842788] [2022-04-28 10:08:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:36,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2232#(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); {2223#true} is VALID [2022-04-28 10:08:36,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 10:08:36,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-28 10:08:36,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:36,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {2232#(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); {2223#true} is VALID [2022-04-28 10:08:36,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 10:08:36,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-28 10:08:36,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-28 10:08:36,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2228#(= main_~y~0 0)} is VALID [2022-04-28 10:08:36,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2228#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:36,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:36,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2231#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {2231#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {2224#false} 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; {2224#false} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:36,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-28 10:08:36,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:36,863 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-28 10:08:36,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-28 10:08:36,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-28 10:08:36,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-28 10:08:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406842788] [2022-04-28 10:08:36,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406842788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872463028] [2022-04-28 10:08:36,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:36,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:36,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:36,879 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 10:08:36,905 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 10:08:36,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:36,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:36,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:36,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:37,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-28 10:08:37,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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); {2223#true} is VALID [2022-04-28 10:08:37,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 10:08:37,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-28 10:08:37,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-28 10:08:37,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2228#(= main_~y~0 0)} is VALID [2022-04-28 10:08:37,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {2228#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:37,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2263#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {2263#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {2224#false} 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; {2224#false} is VALID [2022-04-28 10:08:37,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-28 10:08:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:37,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-28 10:08:37,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-28 10:08:37,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#(not (< 0 (mod 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; {2224#false} is VALID [2022-04-28 10:08:37,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {2322#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2318#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:37,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {2223#true} ~z~0 := ~y~0; {2322#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:37,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#true} assume !(~x~0 % 4294967296 > 0); {2223#true} is VALID [2022-04-28 10:08:37,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2223#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#true} is VALID [2022-04-28 10:08:37,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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); {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-28 10:08:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:37,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872463028] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:37,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:08:37,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 10 [2022-04-28 10:08:37,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:37,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286218107] [2022-04-28 10:08:37,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286218107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:37,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:37,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807758309] [2022-04-28 10:08:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-28 10:08:37,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:37,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,121 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 10:08:37,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:08:37,121 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:37,225 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-04-28 10:08:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-28 10:08:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:08:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:08:37,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 10:08:37,252 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 10:08:37,252 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:08:37,253 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:08:37,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:08:37,253 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:37,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:08:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 10:08:37,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:37,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 10:08:37,328 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 10:08:37,328 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 10:08:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:37,334 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-28 10:08:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-28 10:08:37,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:37,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:37,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 38 states. [2022-04-28 10:08:37,335 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 38 states. [2022-04-28 10:08:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:37,336 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-28 10:08:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-28 10:08:37,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:37,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:37,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:37,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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 10:08:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-28 10:08:37,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 20 [2022-04-28 10:08:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:37,337 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-04-28 10:08:37,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-28 10:08:37,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-28 10:08:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:37,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:37,395 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 10:08:37,413 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 10:08:37,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:37,596 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1005753922, now seen corresponding path program 1 times [2022-04-28 10:08:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117530827] [2022-04-28 10:08:37,599 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:37,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1005753922, now seen corresponding path program 2 times [2022-04-28 10:08:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:37,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005472487] [2022-04-28 10:08:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(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); {2603#true} is VALID [2022-04-28 10:08:37,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 10:08:37,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-28 10:08:37,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:37,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(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); {2603#true} is VALID [2022-04-28 10:08:37,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 10:08:37,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-28 10:08:37,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-28 10:08:37,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2608#(= main_~y~0 0)} is VALID [2022-04-28 10:08:37,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:37,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2611#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:37,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(and (<= main_~z~0 2) (<= 2 main_~z~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; {2612#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {2612#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {2604#false} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 10:08:37,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 10:08:37,674 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 10:08:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005472487] [2022-04-28 10:08:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005472487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787432006] [2022-04-28 10:08:37,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:37,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:37,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:37,676 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 10:08:37,677 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 10:08:37,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:37,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:37,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:37,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-28 10:08:37,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#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); {2603#true} is VALID [2022-04-28 10:08:37,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 10:08:37,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-28 10:08:37,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-28 10:08:37,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2608#(= main_~y~0 0)} is VALID [2022-04-28 10:08:37,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:37,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2644#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {2644#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~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; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 10:08:37,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 10:08:37,884 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 10:08:37,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-28 10:08:37,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {2696#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-28 10:08:37,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2696#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:37,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {2703#(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; {2696#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {2603#true} ~z~0 := ~y~0; {2703#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#true} assume !(~x~0 % 4294967296 > 0); {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {2603#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {2603#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#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); {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-28 10:08:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:37,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787432006] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:08:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 6] total 11 [2022-04-28 10:08:37,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117530827] [2022-04-28 10:08:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117530827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041624171] [2022-04-28 10:08:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-28 10:08:37,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:37,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:37,963 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 10:08:37,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:08:37,964 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,042 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-04-28 10:08:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-28 10:08:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:08:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:08:38,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 10:08:38,063 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 10:08:38,063 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:08:38,063 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:08:38,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:08:38,064 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:38,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:08:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:08:38,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:38,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,109 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,109 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,110 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 10:08:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:38,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,110 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,111 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 10:08:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:38,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:38,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 10:08:38,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2022-04-28 10:08:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:38,113 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 10:08:38,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 10:08:38,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 10:08:38,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:38,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:38,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:38,173 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 10:08:38,371 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,SelfDestructingSolverStorable9 [2022-04-28 10:08:38,371 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-28 10:08:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848907085] [2022-04-28 10:08:38,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:38,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 2 times [2022-04-28 10:08:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021512521] [2022-04-28 10:08:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {2978#(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); {2968#true} is VALID [2022-04-28 10:08:38,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-28 10:08:38,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-28 10:08:38,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:38,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2978#(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); {2968#true} is VALID [2022-04-28 10:08:38,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-28 10:08:38,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-28 10:08:38,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-28 10:08:38,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~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; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~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; {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {2973#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:08:38,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:08:38,477 INFO L272 TraceCheckUtils]: 17: Hoare triple {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:38,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {2976#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2977#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:38,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {2977#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2969#false} is VALID [2022-04-28 10:08:38,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-28 10:08:38,477 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 10:08:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:38,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021512521] [2022-04-28 10:08:38,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021512521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:38,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524724948] [2022-04-28 10:08:38,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:38,479 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 10:08:38,480 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 10:08:38,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:38,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:38,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:08:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:38,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2968#true} is VALID [2022-04-28 10:08:38,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#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); {2968#true} is VALID [2022-04-28 10:08:38,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-28 10:08:38,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-28 10:08:38,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-28 10:08:38,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {3006#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {3006#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~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; {3010#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {3010#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~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; {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {2973#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {2973#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {2973#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:38,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:38,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {3039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2969#false} is VALID [2022-04-28 10:08:38,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-28 10:08:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:38,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:38,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-28 10:08:38,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {3039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2969#false} is VALID [2022-04-28 10:08:38,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:38,793 INFO L272 TraceCheckUtils]: 17: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:38,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:38,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:38,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:08:38,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:08:38,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:38,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 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; {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:38,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {3078#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:08:38,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {3082#(or (= (mod (+ main_~y~0 4294967295) 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; {3078#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:38,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2968#true} ~z~0 := ~y~0; {3082#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:38,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2968#true} assume !(~x~0 % 4294967296 > 0); {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {2968#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#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); {2968#true} is VALID [2022-04-28 10:08:38,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2968#true} is VALID [2022-04-28 10:08:38,799 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 10:08:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524724948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:38,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:38,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-04-28 10:08:38,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848907085] [2022-04-28 10:08:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848907085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:38,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:38,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151974497] [2022-04-28 10:08:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:38,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:38,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:38,818 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 10:08:38,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:38,819 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:39,077 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 10:08:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:08:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 10:08:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 10:08:39,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 10:08:39,106 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 10:08:39,106 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:08:39,106 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:08:39,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:08:39,107 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 41 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:08:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 10:08:39,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:39,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 10:08:39,158 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 10:08:39,158 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 10:08:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:39,158 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 10:08:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 10:08:39,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:39,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:39,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 37 states. [2022-04-28 10:08:39,159 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 37 states. [2022-04-28 10:08:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:39,159 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 10:08:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 10:08:39,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:39,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:39,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:39,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 10:08:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-28 10:08:39,160 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 21 [2022-04-28 10:08:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:39,161 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-28 10:08:39,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 10:08:39,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 46 transitions. [2022-04-28 10:08:39,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 10:08:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:39,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:39,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:39,223 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 10:08:39,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:39,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2049284511, now seen corresponding path program 3 times [2022-04-28 10:08:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:39,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936204860] [2022-04-28 10:08:39,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:39,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2049284511, now seen corresponding path program 4 times [2022-04-28 10:08:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:39,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697603140] [2022-04-28 10:08:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {3366#(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); {3356#true} is VALID [2022-04-28 10:08:39,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-28 10:08:39,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-28 10:08:39,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:39,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {3366#(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); {3356#true} is VALID [2022-04-28 10:08:39,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-28 10:08:39,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-28 10:08:39,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-28 10:08:39,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3361#(= main_~y~0 0)} is VALID [2022-04-28 10:08:39,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:39,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:39,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~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; {3365#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {3365#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {3357#false} 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; {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {3357#false} assume !(~y~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {3357#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {3357#false} assume !(~x~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {3357#false} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-28 10:08:39,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-28 10:08:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:39,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697603140] [2022-04-28 10:08:39,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697603140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:39,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750986369] [2022-04-28 10:08:39,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:39,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:39,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:39,503 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 10:08:39,504 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 10:08:39,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:39,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:39,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:39,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3356#true} is VALID [2022-04-28 10:08:39,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#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); {3356#true} is VALID [2022-04-28 10:08:39,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-28 10:08:39,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-28 10:08:39,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-28 10:08:39,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3361#(= main_~y~0 0)} is VALID [2022-04-28 10:08:39,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:39,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3397#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {3397#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~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; {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:39,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:39,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= 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; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:39,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:39,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:39,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:39,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,761 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-28 10:08:39,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-28 10:08:39,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-28 10:08:39,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-28 10:08:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:39,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:39,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-28 10:08:39,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-28 10:08:39,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-28 10:08:39,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-28 10:08:39,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-28 10:08:39,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:39,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:39,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:39,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:39,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {3464#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {3356#true} ~z~0 := ~y~0; {3464#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {3356#true} assume !(~x~0 % 4294967296 > 0); {3356#true} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {3356#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3356#true} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {3356#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3356#true} is VALID [2022-04-28 10:08:39,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#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); {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3356#true} is VALID [2022-04-28 10:08:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:39,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750986369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:39,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:39,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 13 [2022-04-28 10:08:39,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:39,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936204860] [2022-04-28 10:08:39,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936204860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:39,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:39,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104965771] [2022-04-28 10:08:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:39,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:39,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:39,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:39,895 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 10:08:39,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:39,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:39,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:39,896 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,348 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-28 10:08:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:08:40,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-28 10:08:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-28 10:08:40,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-28 10:08:40,396 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 10:08:40,396 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:08:40,396 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 10:08:40,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:40,397 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:40,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 10:08:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-04-28 10:08:40,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:40,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 10:08:40,473 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 10:08:40,473 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 10:08:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,474 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 10:08:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 10:08:40,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 58 states. [2022-04-28 10:08:40,475 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 58 states. [2022-04-28 10:08:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,476 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 10:08:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 10:08:40,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:40,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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 10:08:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-28 10:08:40,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2022-04-28 10:08:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:40,477 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-28 10:08:40,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 10:08:40,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-28 10:08:40,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 10:08:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:40,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:40,532 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:40,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:08:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:40,735 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-04-28 10:08:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:40,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806356788] [2022-04-28 10:08:40,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:40,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 4 times [2022-04-28 10:08:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:40,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502357731] [2022-04-28 10:08:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(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); {3857#true} is VALID [2022-04-28 10:08:40,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-28 10:08:40,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:40,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(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); {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-28 10:08:40,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-28 10:08:40,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:40,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:40,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:40,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:40,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:40,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:40,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:40,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-28 10:08:40,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:40,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-28 10:08:40,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:40,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-28 10:08:40,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-28 10:08:40,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-28 10:08:40,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-28 10:08:40,789 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 10:08:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502357731] [2022-04-28 10:08:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502357731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426106936] [2022-04-28 10:08:40,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:40,790 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 10:08:40,791 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 10:08:40,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:40,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:40,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:08:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:41,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#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); {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-28 10:08:41,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-28 10:08:41,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-28 10:08:41,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-28 10:08:41,047 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 10:08:41,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:41,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-28 10:08:41,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-28 10:08:41,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-28 10:08:41,114 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-28 10:08:41,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:41,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-28 10:08:41,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-28 10:08:41,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-28 10:08:41,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= 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; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:41,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:41,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#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); {3857#true} is VALID [2022-04-28 10:08:41,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-28 10:08:41,119 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 10:08:41,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426106936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:41,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:41,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:08:41,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:41,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806356788] [2022-04-28 10:08:41,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806356788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:41,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:41,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635744521] [2022-04-28 10:08:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 22 [2022-04-28 10:08:41,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:41,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 10:08:41,136 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 10:08:41,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:41,137 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 10:08:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:41,302 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-28 10:08:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 22 [2022-04-28 10:08:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 10:08:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 10:08:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 10:08:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 10:08:41,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-28 10:08:41,331 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 10:08:41,331 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:08:41,331 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:08:41,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:08:41,332 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:41,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:08:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:08:41,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:41,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,377 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,377 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:41,378 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 10:08:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:41,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:41,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:41,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,378 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:41,379 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 10:08:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:41,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:41,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:41,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:41,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 10:08:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 10:08:41,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 22 [2022-04-28 10:08:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:41,380 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 10:08:41,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 10:08:41,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 10:08:41,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 10:08:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:41,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:41,429 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:41,447 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 10:08:41,629 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,SelfDestructingSolverStorable12 [2022-04-28 10:08:41,630 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1412676430, now seen corresponding path program 5 times [2022-04-28 10:08:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:41,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289690572] [2022-04-28 10:08:41,633 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:41,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1412676430, now seen corresponding path program 6 times [2022-04-28 10:08:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:41,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599455250] [2022-04-28 10:08:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:41,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {4261#(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); {4250#true} is VALID [2022-04-28 10:08:41,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-28 10:08:41,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-28 10:08:41,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:41,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {4261#(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); {4250#true} is VALID [2022-04-28 10:08:41,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-28 10:08:41,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-28 10:08:41,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-28 10:08:41,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4255#(= main_~y~0 0)} is VALID [2022-04-28 10:08:41,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {4255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:41,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:41,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4259#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:41,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {4259#(and (<= main_~z~0 3) (<= 3 main_~z~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; {4260#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {4260#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {4251#false} 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; {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#false} assume !(~y~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {4251#false} assume !(~x~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {4251#false} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L272 TraceCheckUtils]: 18: Hoare triple {4251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2022-04-28 10:08:41,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2022-04-28 10:08:41,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-28 10:08:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599455250] [2022-04-28 10:08:41,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599455250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221172606] [2022-04-28 10:08:41,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:41,726 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 10:08:41,727 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 10:08:41,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:41,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:41,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:08:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:41,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:41,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2022-04-28 10:08:41,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#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); {4250#true} is VALID [2022-04-28 10:08:41,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-28 10:08:41,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-28 10:08:41,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-28 10:08:41,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4255#(= main_~y~0 0)} is VALID [2022-04-28 10:08:41,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:41,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:41,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:41,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:41,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {4299#(and (<= main_~y~0 3) (<= 3 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; {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:08:41,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:08:41,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-28 10:08:41,936 INFO L272 TraceCheckUtils]: 18: Hoare triple {4251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4251#false} is VALID [2022-04-28 10:08:41,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2022-04-28 10:08:41,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2022-04-28 10:08:41,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-28 10:08:41,937 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 10:08:41,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:42,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-28 10:08:42,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4251#false} is VALID [2022-04-28 10:08:42,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {4338#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4334#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:42,112 INFO L272 TraceCheckUtils]: 18: Hoare triple {4342#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4338#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:42,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4342#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:08:42,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:42,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:42,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-28 10:08:42,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~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; {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-28 10:08:42,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 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; {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {4250#true} ~z~0 := ~y~0; {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#true} assume !(~x~0 % 4294967296 > 0); {4250#true} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-28 10:08:42,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4250#true} is VALID [2022-04-28 10:08:42,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-28 10:08:42,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-28 10:08:42,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-28 10:08:42,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#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); {4250#true} is VALID [2022-04-28 10:08:42,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2022-04-28 10:08:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221172606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:42,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:42,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-04-28 10:08:42,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:42,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289690572] [2022-04-28 10:08:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289690572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:42,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:42,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386451458] [2022-04-28 10:08:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 22 [2022-04-28 10:08:42,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:42,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 10:08:42,133 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 10:08:42,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:42,134 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 10:08:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,616 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2022-04-28 10:08:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 22 [2022-04-28 10:08:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 10:08:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-28 10:08:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 10:08:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-28 10:08:42,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-04-28 10:08:42,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:42,684 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:08:42,684 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 10:08:42,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:08:42,685 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:42,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 10:08:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-28 10:08:42,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:42,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 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 10:08:42,768 INFO L74 IsIncluded]: Start isIncluded. First operand 58 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 10:08:42,768 INFO L87 Difference]: Start difference. First operand 58 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 10:08:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,769 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-28 10:08:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-28 10:08:42,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:42,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:42,770 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 58 states. [2022-04-28 10:08:42,770 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 58 states. [2022-04-28 10:08:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,770 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-28 10:08:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-28 10:08:42,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:42,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:42,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:42,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:42,771 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 10:08:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-28 10:08:42,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2022-04-28 10:08:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:42,772 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-28 10:08:42,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 10:08:42,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-28 10:08:42,828 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 10:08:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-28 10:08:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:42,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:42,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:42,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 10:08:43,029 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,SelfDestructingSolverStorable13 [2022-04-28 10:08:43,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 3 times [2022-04-28 10:08:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:43,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207985960] [2022-04-28 10:08:43,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:43,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 4 times [2022-04-28 10:08:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:43,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389893260] [2022-04-28 10:08:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {4772#(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); {4760#true} is VALID [2022-04-28 10:08:43,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-28 10:08:43,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-28 10:08:43,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:43,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {4772#(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); {4760#true} is VALID [2022-04-28 10:08:43,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-28 10:08:43,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-28 10:08:43,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-28 10:08:43,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4765#(= main_~y~0 0)} is VALID [2022-04-28 10:08:43,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {4765#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4766#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:43,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {4766#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:43,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:43,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:43,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~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; {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:43,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#(and (<= main_~z~0 1) (<= 1 main_~z~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; {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:43,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:43,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {4770#(and (<= main_~z~0 0) (<= 0 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; {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:43,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {4769#(and (<= main_~z~0 1) (<= 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; {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:43,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:43,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:43,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4771#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:43,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {4771#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-28 10:08:43,160 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-28 10:08:43,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-28 10:08:43,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-28 10:08:43,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-28 10:08:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389893260] [2022-04-28 10:08:43,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389893260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322945372] [2022-04-28 10:08:43,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:43,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:43,182 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 10:08:43,197 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 10:08:43,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:43,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:43,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:43,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#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); {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4760#true} is VALID [2022-04-28 10:08:43,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {4760#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:43,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 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; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:43,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {4811#(< 0 (mod main_~x~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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {4811#(< 0 (mod main_~x~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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#false} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {4761#false} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-28 10:08:43,315 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-28 10:08:43,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-28 10:08:43,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-28 10:08:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:43,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:43,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-28 10:08:43,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-28 10:08:43,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-28 10:08:43,385 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-28 10:08:43,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4761#false} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-28 10:08:43,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#false} is VALID [2022-04-28 10:08:43,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-28 10:08:43,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {4811#(< 0 (mod main_~x~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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {4811#(< 0 (mod main_~x~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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 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; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:43,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 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; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:43,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:43,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {4760#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:43,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4760#true} is VALID [2022-04-28 10:08:43,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-28 10:08:43,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-28 10:08:43,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-28 10:08:43,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#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); {4760#true} is VALID [2022-04-28 10:08:43,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-28 10:08:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:43,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322945372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:43,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-28 10:08:43,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:43,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207985960] [2022-04-28 10:08:43,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207985960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:43,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:43,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760818599] [2022-04-28 10:08:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:43,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,408 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 10:08:43,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:43,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:43,409 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,975 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-28 10:08:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:08:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2022-04-28 10:08:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2022-04-28 10:08:43,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 72 transitions. [2022-04-28 10:08:44,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:44,045 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:08:44,045 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:08:44,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:08:44,045 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:44,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:08:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-04-28 10:08:44,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:44,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 10:08:44,125 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 10:08:44,125 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 10:08:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:44,126 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 10:08:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-28 10:08:44,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 60 states. [2022-04-28 10:08:44,127 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 60 states. [2022-04-28 10:08:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:44,127 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 10:08:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-28 10:08:44,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:44,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 10:08:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-28 10:08:44,129 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2022-04-28 10:08:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:44,129 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-28 10:08:44,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:44,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 60 transitions. [2022-04-28 10:08:44,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-28 10:08:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:44,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:44,200 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:44,218 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 10:08:44,401 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,SelfDestructingSolverStorable14 [2022-04-28 10:08:44,401 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1359283201, now seen corresponding path program 7 times [2022-04-28 10:08:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675944110] [2022-04-28 10:08:44,403 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:44,403 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1359283201, now seen corresponding path program 8 times [2022-04-28 10:08:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478696201] [2022-04-28 10:08:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {5317#(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); {5305#true} is VALID [2022-04-28 10:08:44,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-28 10:08:44,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-28 10:08:44,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {5317#(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); {5305#true} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-28 10:08:44,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-28 10:08:44,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5310#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {5310#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {5316#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {5316#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} 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; {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,494 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-28 10:08:44,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-28 10:08:44,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-28 10:08:44,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-28 10:08:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:44,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478696201] [2022-04-28 10:08:44,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478696201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:44,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546032454] [2022-04-28 10:08:44,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:44,496 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 10:08:44,497 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 10:08:44,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:44,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:44,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:08:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:44,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5305#true} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#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); {5305#true} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-28 10:08:44,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-28 10:08:44,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5310#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {5310#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:44,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {5357#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:44,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {5357#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} 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; {5306#false} is VALID [2022-04-28 10:08:44,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-28 10:08:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:44,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-28 10:08:44,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} 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; {5306#false} is VALID [2022-04-28 10:08:44,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {5415#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-28 10:08:44,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {5419#(< 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; {5415#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:44,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {5419#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {5430#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {5434#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:44,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {5438#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5434#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5438#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-28 10:08:44,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-28 10:08:44,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-28 10:08:44,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#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); {5305#true} is VALID [2022-04-28 10:08:44,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5305#true} is VALID [2022-04-28 10:08:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:44,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546032454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:44,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:44,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:08:44,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:44,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675944110] [2022-04-28 10:08:44,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675944110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:44,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:44,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415030131] [2022-04-28 10:08:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:44,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:44,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:44,877 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 10:08:44,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:44,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:44,878 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,666 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-28 10:08:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-28 10:08:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-28 10:08:45,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2022-04-28 10:08:45,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:45,751 INFO L225 Difference]: With dead ends: 106 [2022-04-28 10:08:45,751 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 10:08:45,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:08:45,752 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:45,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 65 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 10:08:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 55. [2022-04-28 10:08:45,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:45,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 10:08:45,860 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 10:08:45,860 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 10:08:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,861 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-28 10:08:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-28 10:08:45,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:45,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:45,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 92 states. [2022-04-28 10:08:45,862 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 92 states. [2022-04-28 10:08:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,863 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-28 10:08:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-28 10:08:45,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:45,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:45,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:45,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 10:08:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-04-28 10:08:45,864 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 23 [2022-04-28 10:08:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:45,864 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-04-28 10:08:45,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:45,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 68 transitions. [2022-04-28 10:08:45,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-28 10:08:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:45,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:45,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:45,958 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 10:08:46,151 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,SelfDestructingSolverStorable15 [2022-04-28 10:08:46,151 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 5 times [2022-04-28 10:08:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:46,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15415933] [2022-04-28 10:08:46,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:46,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 6 times [2022-04-28 10:08:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:46,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758026550] [2022-04-28 10:08:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {5994#(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); {5985#true} is VALID [2022-04-28 10:08:46,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 10:08:46,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-28 10:08:46,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:46,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {5994#(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); {5985#true} is VALID [2022-04-28 10:08:46,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 10:08:46,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-28 10:08:46,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-28 10:08:46,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-28 10:08:46,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:46,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:46,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:46,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:46,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 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; {5992#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:08:46,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {5992#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 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; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:46,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:46,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) 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; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:46,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) 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; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,217 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-28 10:08:46,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-28 10:08:46,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-28 10:08:46,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-28 10:08:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:46,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:46,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758026550] [2022-04-28 10:08:46,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758026550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:46,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082677567] [2022-04-28 10:08:46,218 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:46,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:46,219 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 10:08:46,220 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 10:08:46,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:08:46,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:46,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:46,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2022-04-28 10:08:46,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#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); {5985#true} is VALID [2022-04-28 10:08:46,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 10:08:46,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-28 10:08:46,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-28 10:08:46,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-28 10:08:46,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:46,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:46,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,503 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-28 10:08:46,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-28 10:08:46,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-28 10:08:46,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-28 10:08:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:46,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:46,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-28 10:08:46,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-28 10:08:46,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-28 10:08:46,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 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; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:46,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:46,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:46,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:46,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-28 10:08:46,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-28 10:08:46,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-28 10:08:46,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 10:08:46,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#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); {5985#true} is VALID [2022-04-28 10:08:46,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2022-04-28 10:08:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:46,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082677567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:46,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:46,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 10:08:46,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:46,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15415933] [2022-04-28 10:08:46,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15415933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:46,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:46,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:08:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62081915] [2022-04-28 10:08:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 24 [2022-04-28 10:08:46,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:46,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:08:46,726 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 10:08:46,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:08:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:08:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:46,726 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:08:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,043 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 10:08:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:08:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 24 [2022-04-28 10:08:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:08:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:08:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:08:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:08:47,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 10:08:47,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:47,092 INFO L225 Difference]: With dead ends: 80 [2022-04-28 10:08:47,092 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 10:08:47,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:47,093 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:47,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 10:08:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 10:08:47,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:47,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 10:08:47,234 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 10:08:47,234 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 10:08:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,235 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-28 10:08:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-28 10:08:47,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 70 states. [2022-04-28 10:08:47,236 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 70 states. [2022-04-28 10:08:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,237 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-28 10:08:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-28 10:08:47,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:47,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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 10:08:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2022-04-28 10:08:47,238 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 24 [2022-04-28 10:08:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:47,238 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2022-04-28 10:08:47,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:08:47,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 86 transitions. [2022-04-28 10:08:47,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-04-28 10:08:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:47,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:47,365 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:47,381 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 10:08:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:08:47,567 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 295906898, now seen corresponding path program 9 times [2022-04-28 10:08:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444789095] [2022-04-28 10:08:47,571 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:47,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 295906898, now seen corresponding path program 10 times [2022-04-28 10:08:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392998241] [2022-04-28 10:08:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {6599#(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); {6586#true} is VALID [2022-04-28 10:08:47,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-28 10:08:47,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-28 10:08:47,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:47,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {6599#(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); {6586#true} is VALID [2022-04-28 10:08:47,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-28 10:08:47,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-28 10:08:47,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-28 10:08:47,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6591#(= main_~y~0 0)} is VALID [2022-04-28 10:08:47,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:47,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:47,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:47,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:47,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:47,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(and (<= main_~z~0 5) (<= 5 main_~z~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; {6598#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:47,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {6598#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} 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; {6587#false} is VALID [2022-04-28 10:08:47,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-28 10:08:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:47,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392998241] [2022-04-28 10:08:47,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392998241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:47,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141996504] [2022-04-28 10:08:47,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:47,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:47,688 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 10:08:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 10:08:47,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:47,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:47,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:08:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:47,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-28 10:08:47,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#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); {6586#true} is VALID [2022-04-28 10:08:47,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-28 10:08:47,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-28 10:08:47,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-28 10:08:47,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6591#(= main_~y~0 0)} is VALID [2022-04-28 10:08:47,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:47,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:47,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:47,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:47,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:47,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(and (<= main_~z~0 5) (<= 5 main_~z~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; {6642#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} 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; {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-28 10:08:47,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-28 10:08:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:47,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:48,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} 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; {6587#false} is VALID [2022-04-28 10:08:48,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {6700#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-28 10:08:48,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {6704#(< 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; {6700#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:48,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {6704#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:48,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:48,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {6715#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:48,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {6719#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6715#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:48,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {6723#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6719#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:48,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {6727#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6723#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:48,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {6731#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6727#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:48,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6731#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:48,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-28 10:08:48,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-28 10:08:48,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-28 10:08:48,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#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); {6586#true} is VALID [2022-04-28 10:08:48,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-28 10:08:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:48,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141996504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:48,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:48,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:08:48,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:48,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444789095] [2022-04-28 10:08:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444789095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:48,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:08:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266840468] [2022-04-28 10:08:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:48,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:48,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:48,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:48,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:08:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:08:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:08:48,101 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:49,247 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2022-04-28 10:08:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:08:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-28 10:08:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-28 10:08:49,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 98 transitions. [2022-04-28 10:08:49,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:49,329 INFO L225 Difference]: With dead ends: 141 [2022-04-28 10:08:49,329 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 10:08:49,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:08:49,329 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:49,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 81 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 10:08:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-04-28 10:08:49,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:49,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 10:08:49,485 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 10:08:49,485 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 10:08:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:49,487 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2022-04-28 10:08:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2022-04-28 10:08:49,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:49,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:49,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 124 states. [2022-04-28 10:08:49,488 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 124 states. [2022-04-28 10:08:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:49,489 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2022-04-28 10:08:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2022-04-28 10:08:49,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:49,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:49,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:49,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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 10:08:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-28 10:08:49,493 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 24 [2022-04-28 10:08:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:49,493 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-28 10:08:49,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:08:49,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-28 10:08:49,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-28 10:08:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:08:49,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:49,633 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:49,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:08:49,839 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 67192415, now seen corresponding path program 11 times [2022-04-28 10:08:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:49,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271201585] [2022-04-28 10:08:49,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:49,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 67192415, now seen corresponding path program 12 times [2022-04-28 10:08:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:49,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395691440] [2022-04-28 10:08:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {7468#(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); {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:49,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {7468#(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); {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-28 10:08:49,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-28 10:08:49,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7459#(= main_~y~0 0)} is VALID [2022-04-28 10:08:49,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {7459#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:49,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {7460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:49,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {7461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:49,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {7462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:49,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {7463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:49,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:49,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:49,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {7466#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:49,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {7466#(and (<= main_~z~0 6) (<= 6 main_~z~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; {7467#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:49,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {7467#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-28 10:08:49,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {7455#false} 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; {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {7455#false} assume !(~y~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {7455#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {7455#false} assume !(~x~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {7455#false} assume !(~z~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L272 TraceCheckUtils]: 21: Hoare triple {7455#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {7455#false} ~cond := #in~cond; {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {7455#false} assume 0 == ~cond; {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-28 10:08:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395691440] [2022-04-28 10:08:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395691440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146004337] [2022-04-28 10:08:49,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:49,972 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:49,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 10:08:50,005 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:50,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:50,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:50,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:50,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7454#true} is VALID [2022-04-28 10:08:50,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#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); {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {7454#true} assume !(~x~0 % 4294967296 > 0); {7454#true} is VALID [2022-04-28 10:08:50,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {7454#true} ~z~0 := ~y~0; {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:08:50,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {7511#(= 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; {7515#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:08:50,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {7515#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {7515#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:08:50,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {7515#(= 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; {7522#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:08:50,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {7522#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {7522#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:08:50,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {7522#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:08:50,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {7511#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:08:50,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {7511#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {7535#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:50,243 INFO L272 TraceCheckUtils]: 21: Hoare triple {7535#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:50,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:50,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {7543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7455#false} is VALID [2022-04-28 10:08:50,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-28 10:08:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:08:50,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:50,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-28 10:08:50,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {7543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7455#false} is VALID [2022-04-28 10:08:50,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:50,412 INFO L272 TraceCheckUtils]: 21: Hoare triple {7535#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:50,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7535#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:50,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:50,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:50,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:08:50,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:08:50,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:08:50,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:08:50,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {7454#true} ~z~0 := ~y~0; {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:50,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {7454#true} assume !(~x~0 % 4294967296 > 0); {7454#true} is VALID [2022-04-28 10:08:50,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#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); {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7454#true} is VALID [2022-04-28 10:08:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:08:50,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146004337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:50,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:50,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2022-04-28 10:08:50,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:50,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271201585] [2022-04-28 10:08:50,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271201585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:50,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:50,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916815699] [2022-04-28 10:08:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:50,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:50,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:50,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:50,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:50,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:08:50,434 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:51,942 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2022-04-28 10:08:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:08:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-04-28 10:08:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-04-28 10:08:51,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 110 transitions. [2022-04-28 10:08:52,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:52,049 INFO L225 Difference]: With dead ends: 158 [2022-04-28 10:08:52,049 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 10:08:52,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:08:52,049 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:52,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 90 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:08:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 10:08:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-04-28 10:08:52,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:52,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 10:08:52,249 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 10:08:52,249 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 10:08:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,251 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-04-28 10:08:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-04-28 10:08:52,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 141 states. [2022-04-28 10:08:52,252 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 141 states. [2022-04-28 10:08:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,256 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-04-28 10:08:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-04-28 10:08:52,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:52,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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 10:08:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-04-28 10:08:52,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 25 [2022-04-28 10:08:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:52,259 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-04-28 10:08:52,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:08:52,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 108 transitions. [2022-04-28 10:08:52,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-04-28 10:08:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:52,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:52,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:52,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:52,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:52,613 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-04-28 10:08:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:52,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989621285] [2022-04-28 10:08:52,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:52,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 6 times [2022-04-28 10:08:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634227353] [2022-04-28 10:08:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {8426#(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); {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:52,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {8426#(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); {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-28 10:08:52,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-28 10:08:52,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8420#(= main_~y~0 0)} is VALID [2022-04-28 10:08:52,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {8420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:52,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~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; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~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; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~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; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:52,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~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; {8420#(= main_~y~0 0)} is VALID [2022-04-28 10:08:52,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {8420#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {8420#(= main_~y~0 0)} is VALID [2022-04-28 10:08:52,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {8420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:52,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:52,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:52,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:08:52,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:08:52,732 INFO L272 TraceCheckUtils]: 22: Hoare triple {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8424#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:52,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {8424#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8425#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:52,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {8425#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8416#false} is VALID [2022-04-28 10:08:52,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-28 10:08:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:52,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634227353] [2022-04-28 10:08:52,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634227353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:52,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846884156] [2022-04-28 10:08:52,733 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:52,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:52,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 10:08:52,766 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:08:52,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:52,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:08:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:52,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#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); {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {8415#true} assume !(~x~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {8415#true} ~z~0 := ~y~0; {8415#true} is VALID [2022-04-28 10:08:52,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:52,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:52,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#true} assume !(~z~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-28 10:08:52,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:52,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:52,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {8415#true} assume !(~y~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:52,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:52,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:52,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:52,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:52,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:52,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:52,973 INFO L272 TraceCheckUtils]: 22: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:52,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:52,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8416#false} is VALID [2022-04-28 10:08:52,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-28 10:08:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:52,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:53,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-28 10:08:53,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8416#false} is VALID [2022-04-28 10:08:53,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:53,062 INFO L272 TraceCheckUtils]: 22: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:53,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:53,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:53,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:53,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:53,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {8415#true} assume !(~y~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#true} assume !(~z~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {8415#true} 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; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {8415#true} ~z~0 := ~y~0; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {8415#true} assume !(~x~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-28 10:08:53,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#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); {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8415#true} is VALID [2022-04-28 10:08:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:53,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846884156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:53,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:53,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-28 10:08:53,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:53,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989621285] [2022-04-28 10:08:53,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989621285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:53,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:53,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501663225] [2022-04-28 10:08:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 26 [2022-04-28 10:08:53,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:53,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 10:08:53,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:08:53,104 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 10:08:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:53,573 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-28 10:08:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:53,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 26 [2022-04-28 10:08:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 10:08:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:08:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 10:08:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:08:53,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 10:08:53,604 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 10:08:53,605 INFO L225 Difference]: With dead ends: 94 [2022-04-28 10:08:53,605 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 10:08:53,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:53,607 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:53,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 10:08:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 10:08:53,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:53,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 10:08:53,818 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 10:08:53,818 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 10:08:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:53,819 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-04-28 10:08:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-28 10:08:53,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:53,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:53,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 86 states. [2022-04-28 10:08:53,820 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 86 states. [2022-04-28 10:08:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:53,821 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-04-28 10:08:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-28 10:08:53,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:53,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:53,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:53,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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 10:08:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2022-04-28 10:08:53,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 26 [2022-04-28 10:08:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:53,822 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2022-04-28 10:08:53,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 10:08:53,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 109 transitions. [2022-04-28 10:08:53,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-28 10:08:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:53,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:53,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:54,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:54,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:54,186 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -323050508, now seen corresponding path program 13 times [2022-04-28 10:08:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:54,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691885776] [2022-04-28 10:08:54,189 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:54,189 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash -323050508, now seen corresponding path program 14 times [2022-04-28 10:08:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:54,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003949593] [2022-04-28 10:08:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#(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); {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:54,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(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); {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-28 10:08:54,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-28 10:08:54,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9134#(= main_~y~0 0)} is VALID [2022-04-28 10:08:54,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {9134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:54,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:54,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9138#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:54,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {9138#(and (<= main_~z~0 3) (<= 3 main_~z~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; {9139#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:54,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {9139#(and (<= main_~z~0 2) (<= 2 main_~z~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; {9140#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:54,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {9140#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-28 10:08:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003949593] [2022-04-28 10:08:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003949593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891820921] [2022-04-28 10:08:54,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:54,328 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:54,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 10:08:54,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:54,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:08:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:54,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9129#true} is VALID [2022-04-28 10:08:54,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#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); {9129#true} is VALID [2022-04-28 10:08:54,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-28 10:08:54,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-28 10:08:54,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-28 10:08:54,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9134#(= main_~y~0 0)} is VALID [2022-04-28 10:08:54,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {9134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:54,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:54,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9175#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {9175#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {9179#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:54,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {9179#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= 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; {9183#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {9183#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {9130#false} 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; {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-28 10:08:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:54,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:54,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-28 10:08:54,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-28 10:08:54,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {9250#(not (< 0 (mod 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; {9130#false} is VALID [2022-04-28 10:08:54,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {9254#(not (< 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; {9250#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:54,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {9258#(not (< 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; {9254#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:54,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {9262#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9258#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:54,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {9266#(or (not (< 0 (mod (+ main_~y~0 4294967294) 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; {9262#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {9270#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {9266#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {9129#true} ~z~0 := ~y~0; {9270#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {9129#true} assume !(~x~0 % 4294967296 > 0); {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-28 10:08:54,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-28 10:08:54,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#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); {9129#true} is VALID [2022-04-28 10:08:54,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9129#true} is VALID [2022-04-28 10:08:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891820921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:54,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:54,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-28 10:08:54,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691885776] [2022-04-28 10:08:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691885776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:54,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:54,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454716644] [2022-04-28 10:08:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 26 [2022-04-28 10:08:54,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:54,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:54,725 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 10:08:54,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:54,726 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,477 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2022-04-28 10:08:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:08:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 26 [2022-04-28 10:08:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-28 10:08:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-28 10:08:55,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-04-28 10:08:55,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:55,550 INFO L225 Difference]: With dead ends: 120 [2022-04-28 10:08:55,550 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 10:08:55,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:55,553 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:55,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 54 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 10:08:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 86. [2022-04-28 10:08:55,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:55,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 10:08:55,788 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 10:08:55,788 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 10:08:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,789 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-04-28 10:08:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-28 10:08:55,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:55,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:55,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 107 states. [2022-04-28 10:08:55,790 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 107 states. [2022-04-28 10:08:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,804 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-04-28 10:08:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-28 10:08:55,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:55,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:55,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:55,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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 10:08:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-28 10:08:55,805 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 26 [2022-04-28 10:08:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:55,805 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-28 10:08:55,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10:08:55,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-28 10:08:56,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 10:08:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:56,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:56,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:56,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:56,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:56,208 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash -197432477, now seen corresponding path program 7 times [2022-04-28 10:08:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:56,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442346697] [2022-04-28 10:08:56,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:56,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -197432477, now seen corresponding path program 8 times [2022-04-28 10:08:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:56,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916651331] [2022-04-28 10:08:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {9964#(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); {9950#true} is VALID [2022-04-28 10:08:56,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-28 10:08:56,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-28 10:08:56,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:56,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {9964#(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); {9950#true} is VALID [2022-04-28 10:08:56,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-28 10:08:56,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-28 10:08:56,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-28 10:08:56,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9955#(= main_~y~0 0)} is VALID [2022-04-28 10:08:56,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {9955#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:56,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {9956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:56,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:56,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~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; {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:56,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {9960#(and (<= main_~z~0 2) (<= 2 main_~z~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; {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:56,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {9961#(and (<= main_~z~0 1) (<= 1 main_~z~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; {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:56,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:56,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {9962#(and (<= main_~z~0 0) (<= 0 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; {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:56,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {9961#(and (<= main_~z~0 1) (<= 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; {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:56,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {9960#(and (<= main_~z~0 2) (<= 2 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; {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:56,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:56,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:56,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9963#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:56,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {9963#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-28 10:08:56,355 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-28 10:08:56,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-28 10:08:56,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-28 10:08:56,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-28 10:08:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:56,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916651331] [2022-04-28 10:08:56,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916651331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:56,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698360421] [2022-04-28 10:08:56,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:56,357 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:56,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 10:08:56,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:56,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:56,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:56,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9950#true} is VALID [2022-04-28 10:08:56,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#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); {9950#true} is VALID [2022-04-28 10:08:56,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-28 10:08:56,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-28 10:08:56,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-28 10:08:56,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9950#true} is VALID [2022-04-28 10:08:56,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {9950#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:56,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:56,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 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; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 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; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {9951#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {9951#false} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-28 10:08:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:08:56,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:56,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-28 10:08:56,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-28 10:08:56,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-28 10:08:56,584 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-28 10:08:56,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {9951#false} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-28 10:08:56,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {9951#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9951#false} is VALID [2022-04-28 10:08:56,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-28 10:08:56,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {10010#(< 0 (mod main_~x~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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 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; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:56,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 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; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:56,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 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; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:56,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:56,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:56,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {9950#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:56,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9950#true} is VALID [2022-04-28 10:08:56,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-28 10:08:56,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-28 10:08:56,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-28 10:08:56,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#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); {9950#true} is VALID [2022-04-28 10:08:56,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9950#true} is VALID [2022-04-28 10:08:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:08:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698360421] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:56,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:56,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:08:56,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:56,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442346697] [2022-04-28 10:08:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442346697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:56,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:56,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926515263] [2022-04-28 10:08:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 26 [2022-04-28 10:08:56,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:56,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 10:08:56,612 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 10:08:56,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:56,613 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 10:08:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:57,960 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2022-04-28 10:08:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:08:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 26 [2022-04-28 10:08:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 10:08:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2022-04-28 10:08:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 10:08:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2022-04-28 10:08:57,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2022-04-28 10:08:58,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:58,048 INFO L225 Difference]: With dead ends: 130 [2022-04-28 10:08:58,048 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 10:08:58,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:08:58,049 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:58,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 10:08:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2022-04-28 10:08:58,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:58,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 10:08:58,277 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 10:08:58,277 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 10:08:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:58,279 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-28 10:08:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-28 10:08:58,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:58,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:58,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 116 states. [2022-04-28 10:08:58,279 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 116 states. [2022-04-28 10:08:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:58,281 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-28 10:08:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-28 10:08:58,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:58,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:58,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:58,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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 10:08:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2022-04-28 10:08:58,284 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 26 [2022-04-28 10:08:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:58,284 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2022-04-28 10:08:58,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 10:08:58,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 114 transitions. [2022-04-28 10:08:58,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2022-04-28 10:08:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:58,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:58,485 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:58,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 10:08:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:58,686 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1566978034, now seen corresponding path program 15 times [2022-04-28 10:08:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93517847] [2022-04-28 10:08:58,688 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:58,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1566978034, now seen corresponding path program 16 times [2022-04-28 10:08:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722362789] [2022-04-28 10:08:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {10863#(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); {10848#true} is VALID [2022-04-28 10:08:58,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-28 10:08:58,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-28 10:08:58,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:58,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#(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); {10848#true} is VALID [2022-04-28 10:08:58,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-28 10:08:58,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-28 10:08:58,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-28 10:08:58,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10853#(= main_~y~0 0)} is VALID [2022-04-28 10:08:58,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {10853#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:58,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:58,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:58,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:58,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:58,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:58,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:58,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:58,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {10861#(and (<= main_~z~0 7) (<= 7 main_~z~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; {10862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {10862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} 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; {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-28 10:08:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722362789] [2022-04-28 10:08:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722362789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848132769] [2022-04-28 10:08:58,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:58,847 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:58,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 10:08:58,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:58,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:58,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:59,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10848#true} is VALID [2022-04-28 10:08:59,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#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); {10848#true} is VALID [2022-04-28 10:08:59,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-28 10:08:59,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-28 10:08:59,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-28 10:08:59,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10853#(= main_~y~0 0)} is VALID [2022-04-28 10:08:59,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {10853#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:59,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:59,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:59,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:59,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:59,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:59,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:59,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:59,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:59,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {10861#(and (<= main_~z~0 7) (<= 7 main_~z~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; {10912#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:59,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {10912#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} 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; {10849#false} is VALID [2022-04-28 10:08:59,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-28 10:08:59,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-28 10:08:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:59,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:59,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} 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; {10849#false} is VALID [2022-04-28 10:08:59,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {10970#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-28 10:08:59,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {10974#(< 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; {10970#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:59,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {10974#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:59,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:59,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {10985#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:59,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {10989#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10985#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:59,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {10993#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10989#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:59,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {10997#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10993#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:59,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {11001#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10997#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:59,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {11005#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11001#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:59,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {11009#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11005#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:59,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11009#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:59,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-28 10:08:59,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-28 10:08:59,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-28 10:08:59,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#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); {10848#true} is VALID [2022-04-28 10:08:59,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10848#true} is VALID [2022-04-28 10:08:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:59,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848132769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:59,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:59,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:08:59,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:59,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93517847] [2022-04-28 10:08:59,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93517847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425772727] [2022-04-28 10:08:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-28 10:08:59,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:59,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:08:59,370 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 10:08:59,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:08:59,371 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:09:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,359 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2022-04-28 10:09:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:09:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-28 10:09:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:09:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-04-28 10:09:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:09:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-04-28 10:09:01,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2022-04-28 10:09:01,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:01,454 INFO L225 Difference]: With dead ends: 200 [2022-04-28 10:09:01,454 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 10:09:01,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:09:01,455 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 86 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:01,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 101 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 10:09:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 100. [2022-04-28 10:09:01,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:01,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 10:09:01,731 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 10:09:01,731 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 10:09:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,733 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2022-04-28 10:09:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions. [2022-04-28 10:09:01,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 183 states. [2022-04-28 10:09:01,734 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 183 states. [2022-04-28 10:09:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,736 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2022-04-28 10:09:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions. [2022-04-28 10:09:01,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:01,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 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 10:09:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-28 10:09:01,738 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 26 [2022-04-28 10:09:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:01,738 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-28 10:09:01,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:09:01,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 125 transitions. [2022-04-28 10:09:01,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-28 10:09:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:01,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:01,968 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:01,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:02,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,169 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 7 times [2022-04-28 10:09:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [890721078] [2022-04-28 10:09:02,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 8 times [2022-04-28 10:09:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867713346] [2022-04-28 10:09:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {12026#(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); {12018#true} is VALID [2022-04-28 10:09:02,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-28 10:09:02,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:02,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {12026#(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); {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= 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; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-28 10:09:02,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-28 10:09:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:09:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867713346] [2022-04-28 10:09:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867713346] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241252325] [2022-04-28 10:09:02,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:02,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:02,233 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:02,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 10:09:02,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:02,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:02,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:02,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#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); {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= 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; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-28 10:09:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:09:02,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:02,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-28 10:09:02,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-28 10:09:02,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= 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; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:02,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= 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; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:02,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:02,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-28 10:09:02,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-28 10:09:02,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-28 10:09:02,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-28 10:09:02,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-28 10:09:02,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#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); {12018#true} is VALID [2022-04-28 10:09:02,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12018#true} is VALID [2022-04-28 10:09:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:09:02,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241252325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:02,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:02,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-28 10:09:02,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:02,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [890721078] [2022-04-28 10:09:02,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [890721078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:02,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:02,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673785137] [2022-04-28 10:09:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:02,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 27 [2022-04-28 10:09:02,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:02,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 10:09:02,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:02,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:09:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:09:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:09:02,569 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 10:09:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,956 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-28 10:09:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:09:02,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 27 [2022-04-28 10:09:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 10:09:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 10:09:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 10:09:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 10:09:02,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 10:09:02,987 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 10:09:02,988 INFO L225 Difference]: With dead ends: 111 [2022-04-28 10:09:02,988 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 10:09:02,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:09:02,989 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:02,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 10:09:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-28 10:09:03,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:03,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 10:09:03,206 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 10:09:03,206 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 10:09:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,207 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-04-28 10:09:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-28 10:09:03,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 90 states. [2022-04-28 10:09:03,208 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 90 states. [2022-04-28 10:09:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,209 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-04-28 10:09:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-28 10:09:03,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:03,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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 10:09:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2022-04-28 10:09:03,210 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 27 [2022-04-28 10:09:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:03,210 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2022-04-28 10:09:03,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 10:09:03,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 111 transitions. [2022-04-28 10:09:03,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2022-04-28 10:09:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:03,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:03,393 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:03,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:03,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,593 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 815691967, now seen corresponding path program 17 times [2022-04-28 10:09:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313870566] [2022-04-28 10:09:03,595 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:03,596 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash 815691967, now seen corresponding path program 18 times [2022-04-28 10:09:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257995959] [2022-04-28 10:09:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {12788#(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); {12772#true} is VALID [2022-04-28 10:09:03,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-28 10:09:03,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-28 10:09:03,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:03,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {12788#(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); {12772#true} is VALID [2022-04-28 10:09:03,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-28 10:09:03,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-28 10:09:03,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-28 10:09:03,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12777#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {12777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {12778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {12779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {12780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {12781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:03,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {12782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:03,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {12783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:03,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {12784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:03,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:03,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {12786#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {12786#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {12787#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {12787#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {12773#false} 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; {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {12773#false} assume !(~y~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {12773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {12773#false} assume !(~x~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {12773#false} assume !(~z~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-28 10:09:03,773 INFO L272 TraceCheckUtils]: 23: Hoare triple {12773#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12773#false} is VALID [2022-04-28 10:09:03,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {12773#false} ~cond := #in~cond; {12773#false} is VALID [2022-04-28 10:09:03,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {12773#false} assume 0 == ~cond; {12773#false} is VALID [2022-04-28 10:09:03,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-28 10:09:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257995959] [2022-04-28 10:09:03,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257995959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237880233] [2022-04-28 10:09:03,780 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:03,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:03,781 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:03,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 10:09:03,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:03,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:04,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#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); {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {12772#true} assume !(~x~0 % 4294967296 > 0); {12772#true} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {12772#true} ~z~0 := ~y~0; {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:04,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {12837#(= 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; {12841#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:04,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {12841#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {12841#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:04,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {12841#(= 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; {12848#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:04,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {12848#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {12848#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:04,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {12848#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:04,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {12837#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:04,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {12837#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {12861#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:04,039 INFO L272 TraceCheckUtils]: 23: Hoare triple {12861#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:04,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:04,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12773#false} is VALID [2022-04-28 10:09:04,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-28 10:09:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:04,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:04,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-28 10:09:04,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12773#false} is VALID [2022-04-28 10:09:04,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:04,226 INFO L272 TraceCheckUtils]: 23: Hoare triple {12861#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:04,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12861#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:04,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:04,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:04,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:04,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:04,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:04,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {12772#true} ~z~0 := ~y~0; {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {12772#true} assume !(~x~0 % 4294967296 > 0); {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-28 10:09:04,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#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); {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12772#true} is VALID [2022-04-28 10:09:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:04,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237880233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:04,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:04,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 23 [2022-04-28 10:09:04,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:04,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313870566] [2022-04-28 10:09:04,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313870566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:04,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:04,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553746227] [2022-04-28 10:09:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:04,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:04,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:04,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:04,250 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 10:09:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:09:04,251 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,565 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2022-04-28 10:09:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-04-28 10:09:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-04-28 10:09:06,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 130 transitions. [2022-04-28 10:09:06,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:06,665 INFO L225 Difference]: With dead ends: 198 [2022-04-28 10:09:06,666 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 10:09:06,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:09:06,666 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:06,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 111 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 10:09:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 96. [2022-04-28 10:09:06,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:06,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 10:09:06,923 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 10:09:06,923 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 10:09:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,925 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-04-28 10:09:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-04-28 10:09:06,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 182 states. [2022-04-28 10:09:06,926 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 182 states. [2022-04-28 10:09:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,929 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-04-28 10:09:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-04-28 10:09:06,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:06,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 10:09:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2022-04-28 10:09:06,930 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 27 [2022-04-28 10:09:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:06,930 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2022-04-28 10:09:06,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:06,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions. [2022-04-28 10:09:07,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2022-04-28 10:09:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:07,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:07,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:07,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:07,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 10:09:07,326 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 9 times [2022-04-28 10:09:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:07,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177733541] [2022-04-28 10:09:07,328 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:07,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 10 times [2022-04-28 10:09:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:07,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748309079] [2022-04-28 10:09:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {13946#(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); {13935#true} is VALID [2022-04-28 10:09:07,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-28 10:09:07,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-28 10:09:07,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:07,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {13946#(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); {13935#true} is VALID [2022-04-28 10:09:07,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-28 10:09:07,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-28 10:09:07,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-28 10:09:07,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-28 10:09:07,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:07,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13941#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:07,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {13941#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:07,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:07,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:07,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 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; {13943#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {13943#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 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; {13944#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:07,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {13944#(<= (+ 2 (* (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; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) 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; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) 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; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) 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; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:07,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-28 10:09:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748309079] [2022-04-28 10:09:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748309079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864198329] [2022-04-28 10:09:07,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:07,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:07,430 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 10:09:07,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:07,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:07,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:07,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13935#true} is VALID [2022-04-28 10:09:07,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#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); {13935#true} is VALID [2022-04-28 10:09:07,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-28 10:09:07,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-28 10:09:07,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-28 10:09:07,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-28 10:09:07,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:07,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:07,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:07,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:07,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-28 10:09:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:07,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-28 10:09:07,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-28 10:09:07,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 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; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:07,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:07,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:07,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:07,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:07,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#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); {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13935#true} is VALID [2022-04-28 10:09:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:07,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864198329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:07,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:09:07,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:07,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177733541] [2022-04-28 10:09:07,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177733541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:07,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122747874] [2022-04-28 10:09:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:07,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:07,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:07,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 10:09:08,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:08,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:08,009 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 10:09:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,653 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2022-04-28 10:09:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:08,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 10:09:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 10:09:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 10:09:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 10:09:08,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-28 10:09:08,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:08,703 INFO L225 Difference]: With dead ends: 132 [2022-04-28 10:09:08,703 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 10:09:08,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:08,704 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:08,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 40 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 10:09:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-04-28 10:09:09,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:09,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 10:09:09,047 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 10:09:09,048 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 10:09:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,056 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2022-04-28 10:09:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2022-04-28 10:09:09,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 121 states. [2022-04-28 10:09:09,057 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 121 states. [2022-04-28 10:09:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,059 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2022-04-28 10:09:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2022-04-28 10:09:09,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:09,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 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 10:09:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2022-04-28 10:09:09,062 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 28 [2022-04-28 10:09:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:09,062 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2022-04-28 10:09:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 10:09:09,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 152 transitions. [2022-04-28 10:09:09,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-28 10:09:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:09,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:09,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:09,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 10:09:09,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:09:09,568 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -173294718, now seen corresponding path program 19 times [2022-04-28 10:09:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249369727] [2022-04-28 10:09:09,571 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:09,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -173294718, now seen corresponding path program 20 times [2022-04-28 10:09:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:09,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029709520] [2022-04-28 10:09:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {14886#(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); {14873#true} is VALID [2022-04-28 10:09:09,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-28 10:09:09,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-28 10:09:09,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:09,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14886#(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); {14873#true} is VALID [2022-04-28 10:09:09,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-28 10:09:09,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-28 10:09:09,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-28 10:09:09,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14878#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {14878#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:09,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14883#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:09,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {14883#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {14884#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:09,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {14884#(and (<= main_~z~0 3) (<= 3 main_~z~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; {14885#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {14874#false} assume !(~y~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {14874#false} assume !(~x~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {14874#false} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L272 TraceCheckUtils]: 24: Hoare triple {14874#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14874#false} is VALID [2022-04-28 10:09:09,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {14874#false} ~cond := #in~cond; {14874#false} is VALID [2022-04-28 10:09:09,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {14874#false} assume 0 == ~cond; {14874#false} is VALID [2022-04-28 10:09:09,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-28 10:09:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:09:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029709520] [2022-04-28 10:09:09,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029709520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446115331] [2022-04-28 10:09:09,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:09,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:09,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:09,688 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:09,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 10:09:09,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:09,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:09,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:09:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:09,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14873#true} is VALID [2022-04-28 10:09:09,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#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); {14873#true} is VALID [2022-04-28 10:09:09,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-28 10:09:09,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-28 10:09:09,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-28 10:09:09,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14878#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {14878#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:09,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14923#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {14923#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 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; {14927#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:09,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {14927#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= 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; {14931#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {14931#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {14874#false} 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; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {14874#false} assume !(~y~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {14874#false} assume !(~x~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {14874#false} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L272 TraceCheckUtils]: 24: Hoare triple {14874#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {14874#false} ~cond := #in~cond; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {14874#false} assume 0 == ~cond; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-28 10:09:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:09:09,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:10,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-28 10:09:10,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {14977#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14874#false} is VALID [2022-04-28 10:09:10,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {14981#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14977#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:10,100 INFO L272 TraceCheckUtils]: 24: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14981#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:10,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:10,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:10,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:10,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-28 10:09:10,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-28 10:09:10,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {14995#(= (mod (+ main_~y~0 1) 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; {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-28 10:09:10,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {14985#(= (mod main_~y~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; {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-28 10:09:10,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {15012#(= (mod (+ main_~y~0 4294967295) 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; {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:10,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {15016#(= (mod (+ main_~y~0 4294967294) 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; {15012#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:09:10,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {15020#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15016#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:09:10,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {15024#(or (= (mod (+ main_~y~0 4294967294) 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; {15020#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {15028#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 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; {15024#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {14873#true} ~z~0 := ~y~0; {15028#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {14873#true} assume !(~x~0 % 4294967296 > 0); {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14873#true} is VALID [2022-04-28 10:09:10,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-28 10:09:10,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-28 10:09:10,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-28 10:09:10,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#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); {14873#true} is VALID [2022-04-28 10:09:10,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14873#true} is VALID [2022-04-28 10:09:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:10,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446115331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:10,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:10,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 24 [2022-04-28 10:09:10,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:10,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249369727] [2022-04-28 10:09:10,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249369727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:10,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:10,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408440059] [2022-04-28 10:09:10,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:10,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:10,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:09:10,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:09:10,124 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:09:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,379 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-28 10:09:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:09:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-04-28 10:09:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:09:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-04-28 10:09:11,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 80 transitions. [2022-04-28 10:09:11,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:11,437 INFO L225 Difference]: With dead ends: 172 [2022-04-28 10:09:11,437 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 10:09:11,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:11,438 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:11,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 72 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 10:09:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2022-04-28 10:09:11,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:11,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 10:09:11,785 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 10:09:11,785 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 10:09:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,786 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-28 10:09:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-04-28 10:09:11,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 158 states. [2022-04-28 10:09:11,787 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 158 states. [2022-04-28 10:09:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,788 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-28 10:09:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-04-28 10:09:11,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:11,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 10:09:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2022-04-28 10:09:11,790 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 28 [2022-04-28 10:09:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:11,790 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2022-04-28 10:09:11,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 10:09:11,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions. [2022-04-28 10:09:12,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2022-04-28 10:09:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:12,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:12,131 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:12,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 10:09:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:09:12,331 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -999339630, now seen corresponding path program 21 times [2022-04-28 10:09:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898141893] [2022-04-28 10:09:12,334 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:12,334 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:12,334 INFO L85 PathProgramCache]: Analyzing trace with hash -999339630, now seen corresponding path program 22 times [2022-04-28 10:09:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:12,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425647091] [2022-04-28 10:09:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {16002#(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); {15985#true} is VALID [2022-04-28 10:09:12,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-28 10:09:12,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-28 10:09:12,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {16002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:12,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {16002#(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); {15985#true} is VALID [2022-04-28 10:09:12,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-28 10:09:12,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-28 10:09:12,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-28 10:09:12,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15990#(= main_~y~0 0)} is VALID [2022-04-28 10:09:12,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {15990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:12,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:12,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:12,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:12,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:12,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:12,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:12,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:12,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:12,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:12,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:12,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {16001#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:12,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {16001#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} 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; {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-28 10:09:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425647091] [2022-04-28 10:09:12,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425647091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:12,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592720905] [2022-04-28 10:09:12,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:12,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:12,514 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:12,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 10:09:12,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:12,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:09:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:12,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {15985#true} is VALID [2022-04-28 10:09:12,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#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); {15985#true} is VALID [2022-04-28 10:09:12,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-28 10:09:12,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-28 10:09:12,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-28 10:09:12,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15990#(= main_~y~0 0)} is VALID [2022-04-28 10:09:12,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {15990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:12,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:12,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:12,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:12,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:12,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:12,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:12,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:12,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:12,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:12,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:12,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {16057#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:12,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {16057#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} 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; {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-28 10:09:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:12,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:13,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-28 10:09:13,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-28 10:09:13,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-28 10:09:13,079 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-28 10:09:13,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:13,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:13,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-28 10:09:13,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:13,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} 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; {15986#false} is VALID [2022-04-28 10:09:13,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {16115#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-28 10:09:13,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {16119#(< 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; {16115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:13,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {16119#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:13,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:13,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {16130#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:13,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {16134#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16130#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:13,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {16138#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16134#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:13,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {16142#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16138#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:13,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {16146#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16142#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:13,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {16150#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16146#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {16154#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16150#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:13,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {16158#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16154#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:13,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {16162#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16158#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:13,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16162#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:13,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-28 10:09:13,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-28 10:09:13,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-28 10:09:13,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#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); {15985#true} is VALID [2022-04-28 10:09:13,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {15985#true} is VALID [2022-04-28 10:09:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592720905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:13,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:13,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:09:13,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898141893] [2022-04-28 10:09:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898141893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:13,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:13,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:09:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748590989] [2022-04-28 10:09:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:13,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 28 [2022-04-28 10:09:13,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:13,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:09:13,116 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 10:09:13,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:09:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:09:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:13,117 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:09:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:15,779 INFO L93 Difference]: Finished difference Result 248 states and 345 transitions. [2022-04-28 10:09:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:09:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 28 [2022-04-28 10:09:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:09:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-28 10:09:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:09:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-28 10:09:15,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 142 transitions. [2022-04-28 10:09:15,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:15,889 INFO L225 Difference]: With dead ends: 248 [2022-04-28 10:09:15,889 INFO L226 Difference]: Without dead ends: 228 [2022-04-28 10:09:15,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:09:15,890 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 95 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:15,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 117 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-28 10:09:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 129. [2022-04-28 10:09:16,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 10:09:16,264 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 10:09:16,264 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 10:09:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,267 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2022-04-28 10:09:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-28 10:09:16,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 228 states. [2022-04-28 10:09:16,268 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 228 states. [2022-04-28 10:09:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,271 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2022-04-28 10:09:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-28 10:09:16,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 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 10:09:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2022-04-28 10:09:16,273 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 28 [2022-04-28 10:09:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,273 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2022-04-28 10:09:16,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:09:16,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 165 transitions. [2022-04-28 10:09:16,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2022-04-28 10:09:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:16,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:16,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:16,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:16,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:16,813 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -409683135, now seen corresponding path program 11 times [2022-04-28 10:09:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:16,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490099990] [2022-04-28 10:09:16,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:16,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -409683135, now seen corresponding path program 12 times [2022-04-28 10:09:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285106004] [2022-04-28 10:09:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {17435#(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); {17419#true} is VALID [2022-04-28 10:09:17,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-28 10:09:17,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-28 10:09:17,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:17,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {17435#(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); {17419#true} is VALID [2022-04-28 10:09:17,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-28 10:09:17,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-28 10:09:17,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-28 10:09:17,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17424#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {17424#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17425#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {17425#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17426#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {17426#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17427#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {17427#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:17,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:17,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {17430#(and (<= main_~z~0 3) (<= 3 main_~z~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; {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:17,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {17431#(and (<= main_~z~0 2) (<= 2 main_~z~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; {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:17,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {17432#(and (<= main_~z~0 1) (<= 1 main_~z~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; {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:17,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:17,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {17433#(and (<= main_~z~0 0) (<= 0 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; {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:17,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {17432#(and (<= main_~z~0 1) (<= 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; {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:17,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {17431#(and (<= main_~z~0 2) (<= 2 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; {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:17,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {17430#(and (<= main_~z~0 3) (<= 3 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; {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:17,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:17,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:17,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17434#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:17,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {17434#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-28 10:09:17,012 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-28 10:09:17,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-28 10:09:17,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-28 10:09:17,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-28 10:09:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:17,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285106004] [2022-04-28 10:09:17,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285106004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935894496] [2022-04-28 10:09:17,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:17,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:17,014 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 10:09:17,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:17,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:17,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:17,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#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); {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17419#true} is VALID [2022-04-28 10:09:17,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {17419#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 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; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 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; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 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; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {17420#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {17420#false} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-28 10:09:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:17,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:17,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-28 10:09:17,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-28 10:09:17,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-28 10:09:17,280 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-28 10:09:17,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {17420#false} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-28 10:09:17,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {17420#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17420#false} is VALID [2022-04-28 10:09:17,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-28 10:09:17,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {17488#(< 0 (mod main_~x~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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 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; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:17,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 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; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 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; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 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; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {17419#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#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); {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17419#true} is VALID [2022-04-28 10:09:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935894496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:17,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:17,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:17,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490099990] [2022-04-28 10:09:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490099990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:17,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933658341] [2022-04-28 10:09:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:17,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:17,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 10:09:17,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:17,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:17,309 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 10:09:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,453 INFO L93 Difference]: Finished difference Result 196 states and 262 transitions. [2022-04-28 10:09:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:09:19,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 10:09:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 129 transitions. [2022-04-28 10:09:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 10:09:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 129 transitions. [2022-04-28 10:09:19,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 129 transitions. [2022-04-28 10:09:19,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:19,553 INFO L225 Difference]: With dead ends: 196 [2022-04-28 10:09:19,553 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 10:09:19,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:09:19,554 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:19,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 74 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 10:09:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2022-04-28 10:09:19,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:19,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 10:09:19,977 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 10:09:19,977 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 10:09:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,979 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-04-28 10:09:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2022-04-28 10:09:19,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 173 states. [2022-04-28 10:09:19,979 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 173 states. [2022-04-28 10:09:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,981 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-04-28 10:09:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2022-04-28 10:09:19,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:19,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 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 10:09:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 171 transitions. [2022-04-28 10:09:19,983 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 171 transitions. Word has length 29 [2022-04-28 10:09:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:19,983 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 171 transitions. [2022-04-28 10:09:19,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 10:09:19,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 171 transitions. [2022-04-28 10:09:20,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2022-04-28 10:09:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:20,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:20,406 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:20,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:20,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:09:20,622 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1430744289, now seen corresponding path program 23 times [2022-04-28 10:09:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:20,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361174541] [2022-04-28 10:09:20,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:20,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1430744289, now seen corresponding path program 24 times [2022-04-28 10:09:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513204878] [2022-04-28 10:09:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {18710#(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); {18692#true} is VALID [2022-04-28 10:09:20,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-28 10:09:20,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-28 10:09:20,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:20,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {18710#(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); {18692#true} is VALID [2022-04-28 10:09:20,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-28 10:09:20,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-28 10:09:20,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-28 10:09:20,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18697#(= main_~y~0 0)} is VALID [2022-04-28 10:09:20,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {18697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:20,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {18698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:20,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {18699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:20,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {18700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:20,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {18701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:20,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {18702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:20,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {18703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:20,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {18704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:20,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {18705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:20,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {18706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:20,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:20,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {18708#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {18708#(and (<= main_~z~0 10) (<= 10 main_~z~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; {18709#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {18709#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {18693#false} 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; {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {18693#false} assume !(~y~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {18693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {18693#false} assume !(~x~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {18693#false} assume !(~z~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-28 10:09:20,832 INFO L272 TraceCheckUtils]: 25: Hoare triple {18693#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18693#false} is VALID [2022-04-28 10:09:20,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {18693#false} ~cond := #in~cond; {18693#false} is VALID [2022-04-28 10:09:20,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {18693#false} assume 0 == ~cond; {18693#false} is VALID [2022-04-28 10:09:20,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-28 10:09:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:20,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513204878] [2022-04-28 10:09:20,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513204878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:20,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877943792] [2022-04-28 10:09:20,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:20,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:20,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:20,834 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:20,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 10:09:20,868 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:20,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:21,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#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); {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {18692#true} assume !(~x~0 % 4294967296 > 0); {18692#true} is VALID [2022-04-28 10:09:21,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {18692#true} ~z~0 := ~y~0; {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:21,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {18765#(= 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; {18769#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:21,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {18769#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {18769#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:21,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {18769#(= 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; {18776#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:21,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {18776#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {18776#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:21,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {18776#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:21,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {18765#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:21,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {18765#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {18789#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:21,097 INFO L272 TraceCheckUtils]: 25: Hoare triple {18789#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:21,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:21,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {18797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18693#false} is VALID [2022-04-28 10:09:21,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-28 10:09:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:21,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:21,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-28 10:09:21,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {18797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18693#false} is VALID [2022-04-28 10:09:21,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:21,299 INFO L272 TraceCheckUtils]: 25: Hoare triple {18789#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:21,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18789#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:21,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:21,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:21,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:21,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:21,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:21,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:21,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {18692#true} ~z~0 := ~y~0; {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:21,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {18692#true} assume !(~x~0 % 4294967296 > 0); {18692#true} is VALID [2022-04-28 10:09:21,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#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); {18692#true} is VALID [2022-04-28 10:09:21,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18692#true} is VALID [2022-04-28 10:09:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877943792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:21,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:21,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 25 [2022-04-28 10:09:21,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:21,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361174541] [2022-04-28 10:09:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361174541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:21,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:21,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293306199] [2022-04-28 10:09:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:21,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:21,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:09:21,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:21,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:09:21,324 INFO L87 Difference]: Start difference. First operand 136 states and 171 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:09:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,890 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2022-04-28 10:09:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:09:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-28 10:09:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:09:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-28 10:09:24,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2022-04-28 10:09:25,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:25,012 INFO L225 Difference]: With dead ends: 304 [2022-04-28 10:09:25,013 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 10:09:25,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:09:25,014 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 108 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:25,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 131 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 10:09:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 146. [2022-04-28 10:09:25,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:25,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 10:09:25,486 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 10:09:25,486 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 10:09:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,490 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-28 10:09:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-28 10:09:25,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 284 states. [2022-04-28 10:09:25,491 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 284 states. [2022-04-28 10:09:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,494 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-28 10:09:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-28 10:09:25,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:25,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 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 10:09:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2022-04-28 10:09:25,496 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 29 [2022-04-28 10:09:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:25,496 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2022-04-28 10:09:25,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:09:25,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 185 transitions. [2022-04-28 10:09:25,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2022-04-28 10:09:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:25,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:25,909 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:25,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 10:09:26,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,109 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 25 times [2022-04-28 10:09:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922762127] [2022-04-28 10:09:26,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:26,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 26 times [2022-04-28 10:09:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:26,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51011827] [2022-04-28 10:09:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {20403#(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); {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:26,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {20403#(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); {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-28 10:09:26,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-28 10:09:26,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20394#(= main_~y~0 0)} is VALID [2022-04-28 10:09:26,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {20394#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:26,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:26,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:26,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:26,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {20400#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:26,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {20400#(and (<= main_~z~0 5) (<= 5 main_~z~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; {20401#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {20401#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {20402#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {20402#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-28 10:09:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51011827] [2022-04-28 10:09:26,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51011827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714710245] [2022-04-28 10:09:26,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:26,231 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:26,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 10:09:26,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:26,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:26,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:09:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:26,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20389#true} is VALID [2022-04-28 10:09:26,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#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); {20389#true} is VALID [2022-04-28 10:09:26,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-28 10:09:26,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-28 10:09:26,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-28 10:09:26,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20394#(= main_~y~0 0)} is VALID [2022-04-28 10:09:26,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {20394#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:26,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:26,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:26,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:26,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {20443#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {20443#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {20447#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:26,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {20447#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= 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; {20451#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {20451#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,414 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-28 10:09:26,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-28 10:09:26,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-28 10:09:26,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-28 10:09:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:26,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:26,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} 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; {20390#false} is VALID [2022-04-28 10:09:26,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {20530#(not (< 0 (mod 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; {20390#false} is VALID [2022-04-28 10:09:26,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {20534#(not (< 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; {20530#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:26,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {20538#(not (< 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; {20534#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:26,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {20542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20538#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:26,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {20546#(or (not (< 0 (mod (+ main_~y~0 4294967294) 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; {20542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:26,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {20550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {20546#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:26,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {20389#true} ~z~0 := ~y~0; {20550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {20389#true} assume !(~x~0 % 4294967296 > 0); {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#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); {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20389#true} is VALID [2022-04-28 10:09:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:26,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714710245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:26,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:26,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:09:26,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:26,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922762127] [2022-04-28 10:09:26,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922762127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:26,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:26,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441056112] [2022-04-28 10:09:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 30 [2022-04-28 10:09:26,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:26,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:09:26,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:26,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:26,592 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:09:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,470 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2022-04-28 10:09:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 30 [2022-04-28 10:09:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:09:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:09:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:28,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-28 10:09:28,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:28,540 INFO L225 Difference]: With dead ends: 228 [2022-04-28 10:09:28,540 INFO L226 Difference]: Without dead ends: 213 [2022-04-28 10:09:28,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:09:28,541 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:28,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-28 10:09:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2022-04-28 10:09:28,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:28,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 10:09:28,984 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 10:09:28,984 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 10:09:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,986 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-04-28 10:09:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2022-04-28 10:09:28,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 213 states. [2022-04-28 10:09:28,987 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 213 states. [2022-04-28 10:09:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,989 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-04-28 10:09:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2022-04-28 10:09:28,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:28,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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 10:09:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2022-04-28 10:09:28,991 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 30 [2022-04-28 10:09:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:28,991 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2022-04-28 10:09:28,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 10:09:28,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 184 transitions. [2022-04-28 10:09:29,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-28 10:09:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:29,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:29,382 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:29,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 10:09:29,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 10:09:29,591 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1919386830, now seen corresponding path program 27 times [2022-04-28 10:09:29,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:29,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270367871] [2022-04-28 10:09:29,594 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:29,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1919386830, now seen corresponding path program 28 times [2022-04-28 10:09:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:29,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072316700] [2022-04-28 10:09:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {21809#(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); {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:29,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {21809#(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); {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-28 10:09:29,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-28 10:09:29,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21795#(= main_~y~0 0)} is VALID [2022-04-28 10:09:29,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {21795#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:29,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:29,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:29,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:29,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:29,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:29,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:29,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:29,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:29,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:29,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:29,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:29,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:29,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {21807#(and (<= main_~z~0 11) (<= 11 main_~z~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; {21808#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {21808#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} 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; {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-28 10:09:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072316700] [2022-04-28 10:09:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072316700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917075726] [2022-04-28 10:09:29,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:29,808 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:29,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 10:09:29,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:29,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:29,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:09:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:30,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21790#true} is VALID [2022-04-28 10:09:30,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#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); {21790#true} is VALID [2022-04-28 10:09:30,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-28 10:09:30,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-28 10:09:30,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-28 10:09:30,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21795#(= main_~y~0 0)} is VALID [2022-04-28 10:09:30,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {21795#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:30,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:30,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:30,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:30,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:30,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:30,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:30,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:30,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:30,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:30,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:30,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:30,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:30,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {21807#(and (<= main_~z~0 11) (<= 11 main_~z~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; {21870#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {21870#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} 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; {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-28 10:09:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:30,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} 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; {21791#false} is VALID [2022-04-28 10:09:30,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {21928#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-28 10:09:30,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {21932#(< 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; {21928#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:30,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21932#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {21943#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {21947#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21943#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:30,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {21951#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21947#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:30,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {21955#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21951#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:30,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {21959#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21955#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:30,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {21963#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21959#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:30,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {21967#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21963#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:30,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {21971#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21967#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:30,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {21975#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21971#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:30,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {21979#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21975#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:30,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {21983#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21979#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:30,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21983#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:30,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-28 10:09:30,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-28 10:09:30,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-28 10:09:30,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#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); {21790#true} is VALID [2022-04-28 10:09:30,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21790#true} is VALID [2022-04-28 10:09:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917075726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:30,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:30,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:09:30,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270367871] [2022-04-28 10:09:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270367871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:30,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:30,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078799828] [2022-04-28 10:09:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 30 [2022-04-28 10:09:30,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:30,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:09:30,463 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 10:09:30,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:30,463 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:09:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,429 INFO L93 Difference]: Finished difference Result 327 states and 454 transitions. [2022-04-28 10:09:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:09:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 30 [2022-04-28 10:09:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:09:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2022-04-28 10:09:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:09:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2022-04-28 10:09:34,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 166 transitions. [2022-04-28 10:09:34,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:34,553 INFO L225 Difference]: With dead ends: 327 [2022-04-28 10:09:34,553 INFO L226 Difference]: Without dead ends: 307 [2022-04-28 10:09:34,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:09:34,554 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 119 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:34,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 137 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:09:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-28 10:09:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 156. [2022-04-28 10:09:35,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:35,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 10:09:35,026 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 10:09:35,026 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 10:09:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:35,030 INFO L93 Difference]: Finished difference Result 307 states and 394 transitions. [2022-04-28 10:09:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 394 transitions. [2022-04-28 10:09:35,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:35,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:35,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 307 states. [2022-04-28 10:09:35,031 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 307 states. [2022-04-28 10:09:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:35,035 INFO L93 Difference]: Finished difference Result 307 states and 394 transitions. [2022-04-28 10:09:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 394 transitions. [2022-04-28 10:09:35,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:35,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:35,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:35,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 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 10:09:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2022-04-28 10:09:35,037 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 30 [2022-04-28 10:09:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:35,038 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2022-04-28 10:09:35,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:09:35,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 198 transitions. [2022-04-28 10:09:35,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2022-04-28 10:09:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:35,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:35,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:35,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 10:09:35,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:35,691 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 9 times [2022-04-28 10:09:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611559553] [2022-04-28 10:09:35,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:35,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 10 times [2022-04-28 10:09:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:35,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126474223] [2022-04-28 10:09:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {23626#(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); {23614#true} is VALID [2022-04-28 10:09:35,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-28 10:09:35,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-28 10:09:35,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:35,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {23626#(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); {23614#true} is VALID [2022-04-28 10:09:35,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-28 10:09:35,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-28 10:09:35,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-28 10:09:35,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 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; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 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; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 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; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 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; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~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; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~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; {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {23619#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:09:35,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:09:35,829 INFO L272 TraceCheckUtils]: 27: Hoare triple {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23624#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:35,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {23624#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23625#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:35,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {23625#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23615#false} is VALID [2022-04-28 10:09:35,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-28 10:09:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126474223] [2022-04-28 10:09:35,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126474223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494562683] [2022-04-28 10:09:35,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:35,831 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:35,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 10:09:35,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:35,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:35,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:09:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:36,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23614#true} is VALID [2022-04-28 10:09:36,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#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); {23614#true} is VALID [2022-04-28 10:09:36,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-28 10:09:36,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-28 10:09:36,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-28 10:09:36,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:36,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:36,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {23660#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {23660#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {23664#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:36,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {23664#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= 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; {23668#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {23668#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 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; {23672#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {23672#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 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; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:36,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~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; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:36,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~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; {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {23619#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:36,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:36,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:36,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:36,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {23619#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,159 INFO L272 TraceCheckUtils]: 27: Hoare triple {23619#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:36,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23719#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:36,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {23719#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23615#false} is VALID [2022-04-28 10:09:36,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-28 10:09:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:36,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:36,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-28 10:09:36,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {23719#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23615#false} is VALID [2022-04-28 10:09:36,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23719#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:36,404 INFO L272 TraceCheckUtils]: 27: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:36,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:36,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:36,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:09:36,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:09:36,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:09:36,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:09:36,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:09:36,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:09:36,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:36,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 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; {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:09:36,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 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; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:09:36,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 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; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:09:36,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {23778#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:09:36,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {23782#(or (= (mod (+ main_~y~0 4294967293) 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; {23778#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:36,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {23786#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {23782#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:36,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {23790#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 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; {23786#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:36,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {23614#true} ~z~0 := ~y~0; {23790#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:36,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {23614#true} assume !(~x~0 % 4294967296 > 0); {23614#true} is VALID [2022-04-28 10:09:36,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#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); {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23614#true} is VALID [2022-04-28 10:09:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:36,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494562683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:36,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:36,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 24 [2022-04-28 10:09:36,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:36,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611559553] [2022-04-28 10:09:36,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611559553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:36,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:36,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890058174] [2022-04-28 10:09:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:36,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 31 [2022-04-28 10:09:36,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:36,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 10:09:36,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:36,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:09:36,441 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 10:09:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,337 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 10:09:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 31 [2022-04-28 10:09:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 10:09:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-28 10:09:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 10:09:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-28 10:09:37,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-04-28 10:09:37,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:37,372 INFO L225 Difference]: With dead ends: 166 [2022-04-28 10:09:37,372 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 10:09:37,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:37,372 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:37,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 10:09:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-28 10:09:37,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:37,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 10:09:37,848 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 10:09:37,848 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 10:09:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,849 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2022-04-28 10:09:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-28 10:09:37,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 157 states. [2022-04-28 10:09:37,850 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 157 states. [2022-04-28 10:09:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,851 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2022-04-28 10:09:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-28 10:09:37,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:37,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 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 10:09:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2022-04-28 10:09:37,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 31 [2022-04-28 10:09:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:37,853 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2022-04-28 10:09:37,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 10:09:37,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 199 transitions. [2022-04-28 10:09:38,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-28 10:09:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:38,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:38,334 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:38,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 10:09:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,534 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2007429169, now seen corresponding path program 13 times [2022-04-28 10:09:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038476868] [2022-04-28 10:09:38,536 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:38,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2007429169, now seen corresponding path program 14 times [2022-04-28 10:09:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:38,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716609234] [2022-04-28 10:09:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {24814#(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); {24798#true} is VALID [2022-04-28 10:09:38,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-28 10:09:38,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-28 10:09:38,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:38,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {24814#(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); {24798#true} is VALID [2022-04-28 10:09:38,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-28 10:09:38,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-28 10:09:38,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-28 10:09:38,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24803#(= main_~y~0 0)} is VALID [2022-04-28 10:09:38,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {24803#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:38,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {24804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:38,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {24805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:38,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {24806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:38,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {24807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24809#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:38,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {24809#(and (<= main_~z~0 5) (<= 5 main_~z~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; {24810#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {24810#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {24811#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {24811#(and (<= main_~z~0 3) (<= 3 main_~z~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; {24812#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:38,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {24812#(and (<= main_~z~0 2) (<= 2 main_~z~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; {24813#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:38,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {24813#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {24799#false} 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; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {24799#false} 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; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {24799#false} 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; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {24799#false} 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; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {24799#false} 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; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {24799#false} assume !(~y~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {24799#false} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-28 10:09:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716609234] [2022-04-28 10:09:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716609234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180379174] [2022-04-28 10:09:38,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:38,700 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:38,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 10:09:38,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:38,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:38,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:38,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#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); {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24798#true} is VALID [2022-04-28 10:09:38,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24798#true} is VALID [2022-04-28 10:09:38,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:38,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:38,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:38,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 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; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:38,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 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; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:38,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 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; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:38,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-28 10:09:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:09:38,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:38,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-28 10:09:38,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-28 10:09:38,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {24870#(< 0 (mod main_~x~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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 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; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:38,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 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; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:38,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 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; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:38,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 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; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:38,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:38,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:38,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:38,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:38,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24798#true} is VALID [2022-04-28 10:09:38,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24798#true} is VALID [2022-04-28 10:09:38,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-28 10:09:38,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-28 10:09:38,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-28 10:09:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#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); {24798#true} is VALID [2022-04-28 10:09:38,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24798#true} is VALID [2022-04-28 10:09:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:09:38,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180379174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:38,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:38,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:38,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:38,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038476868] [2022-04-28 10:09:38,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038476868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:38,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:38,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764734601] [2022-04-28 10:09:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 31 [2022-04-28 10:09:38,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:38,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:39,010 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 10:09:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:39,011 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,295 INFO L93 Difference]: Finished difference Result 239 states and 304 transitions. [2022-04-28 10:09:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:09:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 31 [2022-04-28 10:09:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-28 10:09:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-28 10:09:41,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 97 transitions. [2022-04-28 10:09:41,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:41,367 INFO L225 Difference]: With dead ends: 239 [2022-04-28 10:09:41,367 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 10:09:41,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:09:41,368 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:41,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 92 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 10:09:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2022-04-28 10:09:41,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:41,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 10:09:41,852 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 10:09:41,852 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 10:09:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,854 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2022-04-28 10:09:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-28 10:09:41,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:41,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:41,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 215 states. [2022-04-28 10:09:41,855 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 215 states. [2022-04-28 10:09:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,857 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2022-04-28 10:09:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-28 10:09:41,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:41,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:41,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:41,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 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 10:09:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2022-04-28 10:09:41,860 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 31 [2022-04-28 10:09:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:41,860 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2022-04-28 10:09:41,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:09:41,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 199 transitions. [2022-04-28 10:09:42,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-04-28 10:09:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:42,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:42,336 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:42,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 10:09:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:42,536 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 112563583, now seen corresponding path program 29 times [2022-04-28 10:09:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:42,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904721706] [2022-04-28 10:09:42,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:42,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 112563583, now seen corresponding path program 30 times [2022-04-28 10:09:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021232333] [2022-04-28 10:09:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {26285#(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); {26265#true} is VALID [2022-04-28 10:09:42,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-28 10:09:42,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-28 10:09:42,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:42,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {26285#(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); {26265#true} is VALID [2022-04-28 10:09:42,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-28 10:09:42,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-28 10:09:42,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-28 10:09:42,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26270#(= main_~y~0 0)} is VALID [2022-04-28 10:09:42,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {26270#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26271#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:42,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {26271#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26272#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:42,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {26272#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26273#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:42,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {26273#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26274#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:42,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {26274#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26275#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:42,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {26275#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26276#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:42,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {26276#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26277#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:42,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {26277#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26278#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {26278#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26279#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:42,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {26279#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26280#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:42,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {26280#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26281#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:42,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {26281#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:42,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:42,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {26283#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:42,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {26283#(and (<= main_~z~0 12) (<= 12 main_~z~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; {26284#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:42,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {26284#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-28 10:09:42,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {26266#false} 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; {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {26266#false} assume !(~y~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {26266#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {26266#false} assume !(~x~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {26266#false} assume !(~z~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {26266#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {26266#false} ~cond := #in~cond; {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {26266#false} assume 0 == ~cond; {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-28 10:09:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021232333] [2022-04-28 10:09:42,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021232333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567964871] [2022-04-28 10:09:42,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:42,753 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:09:42,793 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:42,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:42,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:43,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26265#true} is VALID [2022-04-28 10:09:43,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#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); {26265#true} is VALID [2022-04-28 10:09:43,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {26265#true} assume !(~x~0 % 4294967296 > 0); {26265#true} is VALID [2022-04-28 10:09:43,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {26265#true} ~z~0 := ~y~0; {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:43,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {26346#(= 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; {26350#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:43,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {26350#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {26350#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:43,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {26350#(= 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; {26357#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:43,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {26357#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {26357#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:09:43,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {26357#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:43,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {26346#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:43,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {26346#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {26370#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:43,047 INFO L272 TraceCheckUtils]: 27: Hoare triple {26370#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:43,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:43,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {26378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26266#false} is VALID [2022-04-28 10:09:43,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-28 10:09:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:43,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:43,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-28 10:09:43,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {26378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26266#false} is VALID [2022-04-28 10:09:43,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:43,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {26370#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:43,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26370#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:43,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:43,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:43,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:43,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:09:43,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {26265#true} ~z~0 := ~y~0; {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {26265#true} assume !(~x~0 % 4294967296 > 0); {26265#true} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#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); {26265#true} is VALID [2022-04-28 10:09:43,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26265#true} is VALID [2022-04-28 10:09:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:43,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567964871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:43,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:43,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 27 [2022-04-28 10:09:43,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:43,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904721706] [2022-04-28 10:09:43,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904721706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:43,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:43,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723728991] [2022-04-28 10:09:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 31 [2022-04-28 10:09:43,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:43,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:09:43,289 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 10:09:43,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:43,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:09:43,289 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:09:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,062 INFO L93 Difference]: Finished difference Result 351 states and 487 transitions. [2022-04-28 10:09:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:09:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 31 [2022-04-28 10:09:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:09:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2022-04-28 10:09:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:09:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2022-04-28 10:09:48,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 178 transitions. [2022-04-28 10:09:48,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:48,197 INFO L225 Difference]: With dead ends: 351 [2022-04-28 10:09:48,197 INFO L226 Difference]: Without dead ends: 331 [2022-04-28 10:09:48,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:09:48,198 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 130 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:48,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 153 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:09:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-28 10:09:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 168. [2022-04-28 10:09:48,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:48,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 10:09:48,729 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 10:09:48,729 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 10:09:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,733 INFO L93 Difference]: Finished difference Result 331 states and 424 transitions. [2022-04-28 10:09:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 424 transitions. [2022-04-28 10:09:48,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:48,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:48,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 331 states. [2022-04-28 10:09:48,734 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 331 states. [2022-04-28 10:09:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,738 INFO L93 Difference]: Finished difference Result 331 states and 424 transitions. [2022-04-28 10:09:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 424 transitions. [2022-04-28 10:09:48,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:48,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:48,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:48,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 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 10:09:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2022-04-28 10:09:48,740 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 31 [2022-04-28 10:09:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:48,740 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2022-04-28 10:09:48,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:09:48,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 213 transitions. [2022-04-28 10:09:49,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-28 10:09:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:09:49,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:49,325 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:49,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:49,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 10:09:49,525 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 11 times [2022-04-28 10:09:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:49,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946120577] [2022-04-28 10:09:49,527 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:49,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 12 times [2022-04-28 10:09:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679478865] [2022-04-28 10:09:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:49,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {28221#(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); {28212#true} is VALID [2022-04-28 10:09:49,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-28 10:09:49,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {28221#(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); {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= 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; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:49,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= 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; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:49,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-28 10:09:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679478865] [2022-04-28 10:09:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679478865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781126418] [2022-04-28 10:09:49,624 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:49,625 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:49,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:09:49,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:49,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:49,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:49,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28212#true} is VALID [2022-04-28 10:09:49,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#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); {28212#true} is VALID [2022-04-28 10:09:49,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-28 10:09:49,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:49,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= 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; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:49,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= 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; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:49,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:49,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:49,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-28 10:09:49,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:49,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-28 10:09:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:49,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-28 10:09:50,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-28 10:09:50,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-28 10:09:50,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:50,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:50,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= 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; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= 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; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:50,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= 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; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:50,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:50,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#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); {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28212#true} is VALID [2022-04-28 10:09:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781126418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:50,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:50,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-28 10:09:50,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:50,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946120577] [2022-04-28 10:09:50,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946120577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:50,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:50,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506031000] [2022-04-28 10:09:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 32 [2022-04-28 10:09:50,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:50,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 10:09:50,157 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 10:09:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:09:50,157 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 10:09:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,908 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2022-04-28 10:09:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 32 [2022-04-28 10:09:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 10:09:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 10:09:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 10:09:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 10:09:50,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-28 10:09:50,944 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 10:09:50,946 INFO L225 Difference]: With dead ends: 180 [2022-04-28 10:09:50,946 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 10:09:50,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:09:50,946 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:50,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 10:09:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-04-28 10:09:51,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:51,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 10:09:51,398 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 10:09:51,398 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 10:09:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:51,399 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-04-28 10:09:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2022-04-28 10:09:51,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:51,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:51,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 155 states. [2022-04-28 10:09:51,400 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 155 states. [2022-04-28 10:09:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:51,401 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-04-28 10:09:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2022-04-28 10:09:51,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:51,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:51,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:51,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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 10:09:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2022-04-28 10:09:51,403 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 32 [2022-04-28 10:09:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:51,403 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2022-04-28 10:09:51,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 10:09:51,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 195 transitions. [2022-04-28 10:09:51,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2022-04-28 10:09:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:09:51,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:51,830 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:51,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:09:52,030 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 15 times [2022-04-28 10:09:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:52,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751510844] [2022-04-28 10:09:52,033 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:52,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 16 times [2022-04-28 10:09:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:52,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766039094] [2022-04-28 10:09:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:52,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {29408#(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); {29395#true} is VALID [2022-04-28 10:09:52,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-28 10:09:52,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-28 10:09:52,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:52,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {29408#(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); {29395#true} is VALID [2022-04-28 10:09:52,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-28 10:09:52,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-28 10:09:52,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-28 10:09:52,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-28 10:09:52,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29401#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:52,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {29401#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29402#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {29402#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:52,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:52,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:52,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 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; {29404#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:52,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {29404#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 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; {29405#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:52,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {29405#(<= (+ 2 (* (div (+ main_~x~0 2) 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; {29406#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:52,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {29406#(<= (+ 3 (* (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; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) 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; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) 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; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) 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; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) 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; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-28 10:09:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:09:52,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766039094] [2022-04-28 10:09:52,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766039094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141258242] [2022-04-28 10:09:52,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:52,154 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:52,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:09:52,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:52,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:52,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:52,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29395#true} is VALID [2022-04-28 10:09:52,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#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); {29395#true} is VALID [2022-04-28 10:09:52,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-28 10:09:52,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-28 10:09:52,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-28 10:09:52,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-28 10:09:52,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:52,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:52,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-28 10:09:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:09:52,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-28 10:09:52,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-28 10:09:52,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 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; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:52,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:52,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:52,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:52,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:52,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#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); {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29395#true} is VALID [2022-04-28 10:09:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:09:52,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141258242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:52,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:52,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-28 10:09:52,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:52,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751510844] [2022-04-28 10:09:52,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751510844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:52,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:52,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:52,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336340901] [2022-04-28 10:09:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 32 [2022-04-28 10:09:52,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:52,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 10:09:52,740 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 10:09:52,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:52,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:52,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:09:52,741 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 10:09:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:53,890 INFO L93 Difference]: Finished difference Result 198 states and 261 transitions. [2022-04-28 10:09:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 32 [2022-04-28 10:09:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 10:09:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:09:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 10:09:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:09:53,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 10:09:53,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:53,949 INFO L225 Difference]: With dead ends: 198 [2022-04-28 10:09:53,949 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 10:09:53,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:09:53,950 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:53,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 64 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 10:09:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-28 10:09:54,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:54,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 10:09:54,622 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 10:09:54,622 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 10:09:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:54,624 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:09:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:09:54,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:54,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:54,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 186 states. [2022-04-28 10:09:54,625 INFO L87 Difference]: Start difference. First operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 186 states. [2022-04-28 10:09:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:54,626 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:09:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:09:54,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:54,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:54,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:54,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 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 10:09:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 235 transitions. [2022-04-28 10:09:54,629 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 235 transitions. Word has length 32 [2022-04-28 10:09:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:54,629 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 235 transitions. [2022-04-28 10:09:54,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 10:09:54,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 235 transitions. [2022-04-28 10:09:55,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 235 transitions. [2022-04-28 10:09:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:09:55,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:55,264 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:55,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 10:09:55,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:55,464 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1032467933, now seen corresponding path program 17 times [2022-04-28 10:09:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:55,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779516338] [2022-04-28 10:09:55,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:55,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1032467933, now seen corresponding path program 18 times [2022-04-28 10:09:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244271368] [2022-04-28 10:09:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {30772#(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); {30754#true} is VALID [2022-04-28 10:09:55,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-28 10:09:55,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-28 10:09:55,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:55,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {30772#(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); {30754#true} is VALID [2022-04-28 10:09:55,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-28 10:09:55,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-28 10:09:55,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-28 10:09:55,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30759#(= main_~y~0 0)} is VALID [2022-04-28 10:09:55,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {30759#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:55,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {30760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:55,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {30761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:55,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {30762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:55,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {30763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:55,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:55,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:55,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~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; {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:55,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:55,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {30767#(and (<= main_~z~0 3) (<= 3 main_~z~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; {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:55,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {30768#(and (<= main_~z~0 2) (<= 2 main_~z~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; {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:55,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {30769#(and (<= main_~z~0 1) (<= 1 main_~z~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; {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:55,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:55,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {30770#(and (<= main_~z~0 0) (<= 0 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; {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:55,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {30769#(and (<= main_~z~0 1) (<= 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; {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:55,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {30768#(and (<= main_~z~0 2) (<= 2 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; {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:55,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {30767#(and (<= main_~z~0 3) (<= 3 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; {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:55,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {30766#(and (<= 4 main_~z~0) (<= main_~z~0 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; {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:55,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:55,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:55,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30771#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:55,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {30771#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-28 10:09:55,832 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-28 10:09:55,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-28 10:09:55,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-28 10:09:55,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-28 10:09:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244271368] [2022-04-28 10:09:55,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244271368] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903340772] [2022-04-28 10:09:55,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:55,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:55,834 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:55,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:09:55,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:09:55,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:55,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:09:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:56,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30754#true} is VALID [2022-04-28 10:09:56,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#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); {30754#true} is VALID [2022-04-28 10:09:56,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-28 10:09:56,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-28 10:09:56,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-28 10:09:56,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30754#true} is VALID [2022-04-28 10:09:56,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {30754#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:56,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:56,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:56,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:56,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {30810#(< 0 (mod (+ 5 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; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:56,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 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; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:56,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 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; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:56,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 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; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:56,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {30755#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30755#false} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {30755#false} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-28 10:09:56,087 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-28 10:09:56,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-28 10:09:56,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-28 10:09:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:56,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:56,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-28 10:09:56,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-28 10:09:56,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-28 10:09:56,181 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-28 10:09:56,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {30755#false} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-28 10:09:56,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {30755#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30755#false} is VALID [2022-04-28 10:09:56,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-28 10:09:56,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {30832#(< 0 (mod main_~x~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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 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; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:56,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 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; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:56,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 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; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:56,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 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; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:56,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {30810#(< 0 (mod (+ 5 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; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:56,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:09:56,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:56,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:56,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:56,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {30754#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:56,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#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); {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30754#true} is VALID [2022-04-28 10:09:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:56,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903340772] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:56,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:56,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:09:56,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779516338] [2022-04-28 10:09:56,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779516338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:56,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:56,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608052925] [2022-04-28 10:09:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:56,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 32 [2022-04-28 10:09:56,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:56,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 10:09:56,214 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 10:09:56,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:56,215 INFO L87 Difference]: Start difference. First operand 183 states and 235 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 10:09:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:59,544 INFO L93 Difference]: Finished difference Result 254 states and 344 transitions. [2022-04-28 10:09:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 10:09:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 32 [2022-04-28 10:09:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 10:09:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2022-04-28 10:09:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 10:09:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2022-04-28 10:09:59,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 151 transitions. [2022-04-28 10:09:59,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:59,664 INFO L225 Difference]: With dead ends: 254 [2022-04-28 10:09:59,664 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 10:09:59,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=4213, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:09:59,665 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:59,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 85 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 10:10:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 191. [2022-04-28 10:10:00,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:00,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 10:10:00,362 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 10:10:00,362 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 10:10:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:00,364 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-04-28 10:10:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2022-04-28 10:10:00,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:00,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:00,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 238 states. [2022-04-28 10:10:00,365 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 238 states. [2022-04-28 10:10:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:00,379 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-04-28 10:10:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2022-04-28 10:10:00,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:00,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:00,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:00,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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 10:10:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-04-28 10:10:00,383 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 32 [2022-04-28 10:10:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:00,383 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-04-28 10:10:00,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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 10:10:00,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 243 transitions. [2022-04-28 10:10:01,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-04-28 10:10:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:01,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:01,068 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:01,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:10:01,268 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 31 times [2022-04-28 10:10:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:01,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28260509] [2022-04-28 10:10:01,270 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:01,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 32 times [2022-04-28 10:10:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:01,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719961049] [2022-04-28 10:10:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:01,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {32443#(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); {32428#true} is VALID [2022-04-28 10:10:01,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-28 10:10:01,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-28 10:10:01,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:01,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {32443#(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); {32428#true} is VALID [2022-04-28 10:10:01,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-28 10:10:01,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-28 10:10:01,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-28 10:10:01,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32433#(= main_~y~0 0)} is VALID [2022-04-28 10:10:01,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {32433#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:01,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:01,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:01,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:01,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:01,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:01,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:01,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:01,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {32440#(and (<= main_~z~0 6) (<= 6 main_~z~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; {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:01,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {32441#(and (<= main_~z~0 5) (<= 5 main_~z~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; {32442#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:01,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {32442#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-28 10:10:01,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-28 10:10:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:01,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719961049] [2022-04-28 10:10:01,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719961049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:01,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176367298] [2022-04-28 10:10:01,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:01,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:01,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:01,435 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:01,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:10:01,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:01,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:01,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:01,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:01,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-28 10:10:01,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#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); {32428#true} is VALID [2022-04-28 10:10:01,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-28 10:10:01,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-28 10:10:01,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-28 10:10:01,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32433#(= main_~y~0 0)} is VALID [2022-04-28 10:10:01,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {32433#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:01,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:01,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:01,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:01,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:01,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:01,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:01,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:01,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {32440#(and (<= main_~z~0 6) (<= 6 main_~z~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; {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:01,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {32441#(and (<= main_~z~0 5) (<= 5 main_~z~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; {32492#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:01,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {32492#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-28 10:10:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:01,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:01,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-28 10:10:01,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-28 10:10:01,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-28 10:10:01,961 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} 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; {32429#false} is VALID [2022-04-28 10:10:01,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {32586#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-28 10:10:01,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {32590#(< 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; {32586#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:01,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {32594#(< 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; {32590#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:01,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {32594#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:01,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:01,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {32605#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:01,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {32609#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32605#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:01,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {32613#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:01,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {32617#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32613#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:01,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {32621#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32617#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:01,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {32625#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32621#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:01,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32625#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:01,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-28 10:10:01,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-28 10:10:01,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-28 10:10:01,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#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); {32428#true} is VALID [2022-04-28 10:10:01,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-28 10:10:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176367298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:01,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:01,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:01,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28260509] [2022-04-28 10:10:01,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28260509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:01,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:01,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658231802] [2022-04-28 10:10:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 32 [2022-04-28 10:10:01,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:01,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:10:01,987 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 10:10:01,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:01,988 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:10:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:04,615 INFO L93 Difference]: Finished difference Result 300 states and 376 transitions. [2022-04-28 10:10:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 32 [2022-04-28 10:10:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:10:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-28 10:10:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:10:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-28 10:10:04,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2022-04-28 10:10:04,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:04,690 INFO L225 Difference]: With dead ends: 300 [2022-04-28 10:10:04,690 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 10:10:04,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:10:04,691 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:04,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 85 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 10:10:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 191. [2022-04-28 10:10:05,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:05,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 10:10:05,394 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 10:10:05,394 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 10:10:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,398 INFO L93 Difference]: Finished difference Result 284 states and 359 transitions. [2022-04-28 10:10:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2022-04-28 10:10:05,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 284 states. [2022-04-28 10:10:05,398 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 284 states. [2022-04-28 10:10:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,402 INFO L93 Difference]: Finished difference Result 284 states and 359 transitions. [2022-04-28 10:10:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2022-04-28 10:10:05,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:05,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 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 10:10:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2022-04-28 10:10:05,406 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 32 [2022-04-28 10:10:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:05,406 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2022-04-28 10:10:05,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 10:10:05,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 242 transitions. [2022-04-28 10:10:06,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2022-04-28 10:10:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:06,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:06,203 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:06,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:06,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:10:06,404 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483054, now seen corresponding path program 33 times [2022-04-28 10:10:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:06,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677116006] [2022-04-28 10:10:06,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:06,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483054, now seen corresponding path program 34 times [2022-04-28 10:10:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:06,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690782008] [2022-04-28 10:10:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {34243#(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); {34222#true} is VALID [2022-04-28 10:10:06,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-28 10:10:06,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-28 10:10:06,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:06,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {34243#(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); {34222#true} is VALID [2022-04-28 10:10:06,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-28 10:10:06,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-28 10:10:06,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-28 10:10:06,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34227#(= main_~y~0 0)} is VALID [2022-04-28 10:10:06,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {34227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:06,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:06,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:06,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:06,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:06,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:06,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:06,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:06,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:06,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:06,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:06,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:06,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:06,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:06,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {34242#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {34242#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} 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; {34223#false} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,651 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-28 10:10:06,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-28 10:10:06,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-28 10:10:06,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-28 10:10:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:06,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690782008] [2022-04-28 10:10:06,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690782008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:06,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979024140] [2022-04-28 10:10:06,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:06,652 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:06,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:10:06,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:06,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:06,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:10:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:06,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34222#true} is VALID [2022-04-28 10:10:06,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#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); {34222#true} is VALID [2022-04-28 10:10:06,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-28 10:10:06,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-28 10:10:06,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-28 10:10:06,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34227#(= main_~y~0 0)} is VALID [2022-04-28 10:10:06,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {34227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:06,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:06,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:06,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:06,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:06,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:06,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:06,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:06,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:06,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:06,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:06,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:06,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:06,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:06,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:06,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {34310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {34310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} 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; {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-28 10:10:06,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-28 10:10:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:06,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:07,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-28 10:10:07,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-28 10:10:07,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} 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; {34223#false} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {34368#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-28 10:10:07,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {34372#(< 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; {34368#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:07,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {34372#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:07,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:07,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {34383#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:07,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {34387#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34383#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:07,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {34391#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34387#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:07,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {34395#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34391#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:07,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {34399#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34395#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:07,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {34403#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34399#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:07,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {34407#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34403#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:07,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {34411#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34407#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:07,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {34415#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34411#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:07,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {34419#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34415#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:07,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {34423#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34419#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:07,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {34427#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34423#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:07,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {34431#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34427#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:07,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34431#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:07,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-28 10:10:07,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-28 10:10:07,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-28 10:10:07,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#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); {34222#true} is VALID [2022-04-28 10:10:07,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34222#true} is VALID [2022-04-28 10:10:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979024140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:07,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:07,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:10:07,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:07,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677116006] [2022-04-28 10:10:07,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677116006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:07,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:07,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:10:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271531210] [2022-04-28 10:10:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 32 [2022-04-28 10:10:07,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:07,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:10:07,442 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 10:10:07,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:10:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:10:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:10:07,442 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:10:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,172 INFO L93 Difference]: Finished difference Result 430 states and 598 transitions. [2022-04-28 10:10:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 32 [2022-04-28 10:10:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:10:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2022-04-28 10:10:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:10:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2022-04-28 10:10:13,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 186 transitions. [2022-04-28 10:10:13,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:13,314 INFO L225 Difference]: With dead ends: 430 [2022-04-28 10:10:13,315 INFO L226 Difference]: Without dead ends: 407 [2022-04-28 10:10:13,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:10:13,315 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:13,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 158 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:10:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-28 10:10:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 203. [2022-04-28 10:10:14,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:14,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 10:10:14,042 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 10:10:14,042 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 10:10:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,048 INFO L93 Difference]: Finished difference Result 407 states and 515 transitions. [2022-04-28 10:10:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 515 transitions. [2022-04-28 10:10:14,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:14,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:14,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 407 states. [2022-04-28 10:10:14,049 INFO L87 Difference]: Start difference. First operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 407 states. [2022-04-28 10:10:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,061 INFO L93 Difference]: Finished difference Result 407 states and 515 transitions. [2022-04-28 10:10:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 515 transitions. [2022-04-28 10:10:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:14,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:14,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:14,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 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 10:10:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 259 transitions. [2022-04-28 10:10:14,064 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 259 transitions. Word has length 32 [2022-04-28 10:10:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:14,064 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 259 transitions. [2022-04-28 10:10:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:10:14,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 259 transitions. [2022-04-28 10:10:14,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 259 transitions. [2022-04-28 10:10:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:10:14,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:14,838 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:14,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:15,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:10:15,039 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1467711455, now seen corresponding path program 35 times [2022-04-28 10:10:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754982855] [2022-04-28 10:10:15,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:15,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1467711455, now seen corresponding path program 36 times [2022-04-28 10:10:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:15,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635518360] [2022-04-28 10:10:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {36588#(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); {36566#true} is VALID [2022-04-28 10:10:15,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-28 10:10:15,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-28 10:10:15,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:15,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {36588#(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); {36566#true} is VALID [2022-04-28 10:10:15,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-28 10:10:15,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-28 10:10:15,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-28 10:10:15,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36571#(= main_~y~0 0)} is VALID [2022-04-28 10:10:15,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {36571#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:15,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {36572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:15,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {36573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:15,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {36574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36575#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:15,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {36575#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36576#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:15,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {36576#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36577#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:15,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {36577#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36578#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:15,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {36578#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36579#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:15,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {36579#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36580#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:15,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {36580#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36581#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:15,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {36581#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36582#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:15,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {36582#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36583#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:15,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {36583#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36584#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:15,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {36584#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:15,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:15,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {36586#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:10:15,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {36586#(and (<= 14 main_~z~0) (<= main_~z~0 14))} 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; {36587#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:15,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {36587#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-28 10:10:15,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {36567#false} 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; {36567#false} is VALID [2022-04-28 10:10:15,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {36567#false} assume !(~y~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-28 10:10:15,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {36567#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {36567#false} assume !(~x~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {36567#false} assume !(~z~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L272 TraceCheckUtils]: 29: Hoare triple {36567#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {36567#false} ~cond := #in~cond; {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {36567#false} assume 0 == ~cond; {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-28 10:10:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:15,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:15,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635518360] [2022-04-28 10:10:15,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635518360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:15,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044131748] [2022-04-28 10:10:15,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:15,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:15,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:15,296 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:15,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:10:15,331 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:15,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:15,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:10:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:15,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:15,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#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); {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#true} is VALID [2022-04-28 10:10:15,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {36566#true} assume !(~x~0 % 4294967296 > 0); {36566#true} is VALID [2022-04-28 10:10:15,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {36566#true} ~z~0 := ~y~0; {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:15,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {36655#(= 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; {36659#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:10:15,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {36659#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {36659#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:10:15,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {36659#(= 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; {36666#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:10:15,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {36666#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {36666#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:10:15,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {36666#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:15,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {36655#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:15,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {36655#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {36679#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:15,584 INFO L272 TraceCheckUtils]: 29: Hoare triple {36679#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:15,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:15,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {36687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36567#false} is VALID [2022-04-28 10:10:15,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-28 10:10:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:10:15,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:15,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-28 10:10:15,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {36687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36567#false} is VALID [2022-04-28 10:10:15,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:15,805 INFO L272 TraceCheckUtils]: 29: Hoare triple {36679#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:15,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36679#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:15,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:15,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:15,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:10:15,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:10:15,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:10:15,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {36566#true} ~z~0 := ~y~0; {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {36566#true} assume !(~x~0 % 4294967296 > 0); {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#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); {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36566#true} is VALID [2022-04-28 10:10:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:10:15,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044131748] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:15,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:15,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 29 [2022-04-28 10:10:15,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:15,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754982855] [2022-04-28 10:10:15,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754982855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:15,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:15,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:10:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541866206] [2022-04-28 10:10:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 33 [2022-04-28 10:10:15,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:15,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:10:15,836 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 10:10:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:10:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:10:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:10:15,836 INFO L87 Difference]: Start difference. First operand 203 states and 259 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:10:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:22,366 INFO L93 Difference]: Finished difference Result 457 states and 638 transitions. [2022-04-28 10:10:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:10:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 33 [2022-04-28 10:10:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:10:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 198 transitions. [2022-04-28 10:10:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:10:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 198 transitions. [2022-04-28 10:10:22,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 198 transitions. [2022-04-28 10:10:22,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:22,523 INFO L225 Difference]: With dead ends: 457 [2022-04-28 10:10:22,523 INFO L226 Difference]: Without dead ends: 434 [2022-04-28 10:10:22,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=2002, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:10:22,524 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 141 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:22,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 167 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:10:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-28 10:10:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 215. [2022-04-28 10:10:23,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:23,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 10:10:23,300 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 10:10:23,300 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 10:10:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,306 INFO L93 Difference]: Finished difference Result 434 states and 551 transitions. [2022-04-28 10:10:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 551 transitions. [2022-04-28 10:10:23,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:23,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:23,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 434 states. [2022-04-28 10:10:23,307 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 434 states. [2022-04-28 10:10:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,314 INFO L93 Difference]: Finished difference Result 434 states and 551 transitions. [2022-04-28 10:10:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 551 transitions. [2022-04-28 10:10:23,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:23,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:23,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:23,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 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 10:10:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2022-04-28 10:10:23,317 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 33 [2022-04-28 10:10:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:23,317 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2022-04-28 10:10:23,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:10:23,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 276 transitions. [2022-04-28 10:10:24,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-28 10:10:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:24,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:24,044 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:24,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 10:10:24,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:24,245 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1655978978, now seen corresponding path program 37 times [2022-04-28 10:10:24,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:24,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [122464070] [2022-04-28 10:10:24,247 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:24,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1655978978, now seen corresponding path program 38 times [2022-04-28 10:10:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928829521] [2022-04-28 10:10:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:24,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {39059#(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); {39043#true} is VALID [2022-04-28 10:10:24,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-28 10:10:24,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-28 10:10:24,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:24,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {39059#(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); {39043#true} is VALID [2022-04-28 10:10:24,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-28 10:10:24,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-28 10:10:24,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-28 10:10:24,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39048#(= main_~y~0 0)} is VALID [2022-04-28 10:10:24,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {39048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:24,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:24,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:24,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:24,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:24,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {39055#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:24,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {39055#(and (<= main_~z~0 6) (<= 6 main_~z~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; {39056#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:24,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {39056#(and (<= main_~z~0 5) (<= 5 main_~z~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; {39057#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:24,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {39057#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {39058#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:24,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {39058#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {39044#false} assume !(~y~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {39044#false} assume !(~x~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {39044#false} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L272 TraceCheckUtils]: 30: Hoare triple {39044#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {39044#false} ~cond := #in~cond; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {39044#false} assume 0 == ~cond; {39044#false} is VALID [2022-04-28 10:10:24,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-28 10:10:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:24,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:24,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928829521] [2022-04-28 10:10:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928829521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:24,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889679245] [2022-04-28 10:10:24,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:24,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:24,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:24,399 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:24,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:10:24,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:24,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:24,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:10:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:24,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:24,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39043#true} is VALID [2022-04-28 10:10:24,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#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); {39043#true} is VALID [2022-04-28 10:10:24,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-28 10:10:24,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-28 10:10:24,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-28 10:10:24,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39048#(= main_~y~0 0)} is VALID [2022-04-28 10:10:24,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {39048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:24,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:24,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:24,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:24,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:24,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {39102#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {39102#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 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; {39106#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:24,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {39106#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= 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; {39110#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {39110#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 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; {39114#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {39114#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {39044#false} 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; {39044#false} is VALID [2022-04-28 10:10:24,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {39044#false} assume !(~y~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {39044#false} assume !(~x~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {39044#false} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L272 TraceCheckUtils]: 30: Hoare triple {39044#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {39044#false} ~cond := #in~cond; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {39044#false} assume 0 == ~cond; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-28 10:10:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:24,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:24,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-28 10:10:24,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {39169#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39044#false} is VALID [2022-04-28 10:10:24,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {39173#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39169#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:24,983 INFO L272 TraceCheckUtils]: 30: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39173#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:24,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:10:24,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:10:24,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:10:24,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-28 10:10:24,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-28 10:10:24,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} is VALID [2022-04-28 10:10:24,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {39191#(= (mod (+ main_~y~0 2) 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; {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} is VALID [2022-04-28 10:10:24,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {39187#(= (mod (+ main_~y~0 1) 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; {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-28 10:10:24,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {39177#(= (mod main_~y~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; {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-28 10:10:24,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {39211#(= (mod (+ main_~y~0 4294967295) 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; {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:10:24,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {39215#(= (mod (+ main_~y~0 4294967294) 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; {39211#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:10:24,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {39219#(= (mod (+ main_~y~0 4294967293) 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; {39215#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:10:24,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {39223#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {39219#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:10:25,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {39227#(or (= (mod (+ main_~y~0 4294967293) 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; {39223#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:25,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {39231#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {39227#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:25,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {39235#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 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; {39231#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {39043#true} ~z~0 := ~y~0; {39235#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {39043#true} assume !(~x~0 % 4294967296 > 0); {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-28 10:10:25,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-28 10:10:25,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#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); {39043#true} is VALID [2022-04-28 10:10:25,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39043#true} is VALID [2022-04-28 10:10:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:10:25,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889679245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:25,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:25,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 31 [2022-04-28 10:10:25,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:25,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [122464070] [2022-04-28 10:10:25,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [122464070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:25,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:25,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:10:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614488888] [2022-04-28 10:10:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:25,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 34 [2022-04-28 10:10:25,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:25,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:25,022 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 10:10:25,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:10:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:10:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:10:25,023 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:27,817 INFO L93 Difference]: Finished difference Result 314 states and 399 transitions. [2022-04-28 10:10:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:10:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 34 [2022-04-28 10:10:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2022-04-28 10:10:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2022-04-28 10:10:27,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2022-04-28 10:10:28,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:28,054 INFO L225 Difference]: With dead ends: 314 [2022-04-28 10:10:28,054 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 10:10:28,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:10:28,055 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:28,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 80 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 10:10:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-28 10:10:28,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:28,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 10:10:28,917 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 10:10:28,917 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 10:10:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:28,921 INFO L93 Difference]: Finished difference Result 297 states and 381 transitions. [2022-04-28 10:10:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 381 transitions. [2022-04-28 10:10:28,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:28,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:28,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 297 states. [2022-04-28 10:10:28,921 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 297 states. [2022-04-28 10:10:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:28,925 INFO L93 Difference]: Finished difference Result 297 states and 381 transitions. [2022-04-28 10:10:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 381 transitions. [2022-04-28 10:10:28,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:28,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:28,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:28,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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 10:10:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2022-04-28 10:10:28,928 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 34 [2022-04-28 10:10:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:28,928 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2022-04-28 10:10:28,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:28,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 275 transitions. [2022-04-28 10:10:29,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2022-04-28 10:10:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:29,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:29,765 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:29,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 10:10:29,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:29,965 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1305187981, now seen corresponding path program 19 times [2022-04-28 10:10:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:29,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531265758] [2022-04-28 10:10:29,967 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:29,967 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1305187981, now seen corresponding path program 20 times [2022-04-28 10:10:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969721348] [2022-04-28 10:10:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {40982#(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); {40964#true} is VALID [2022-04-28 10:10:30,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-28 10:10:30,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-28 10:10:30,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:30,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {40982#(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); {40964#true} is VALID [2022-04-28 10:10:30,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-28 10:10:30,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-28 10:10:30,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-28 10:10:30,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40969#(= main_~y~0 0)} is VALID [2022-04-28 10:10:30,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {40969#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40970#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:30,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {40970#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40971#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:30,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {40971#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40972#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:30,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {40972#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40973#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:30,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {40973#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40974#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:30,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {40974#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:30,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:30,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {40976#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:30,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {40976#(and (<= main_~z~0 6) (<= 6 main_~z~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; {40977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:30,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {40977#(and (<= main_~z~0 5) (<= 5 main_~z~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; {40978#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:30,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {40978#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {40979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:30,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {40979#(and (<= main_~z~0 3) (<= 3 main_~z~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; {40980#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:30,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {40980#(and (<= main_~z~0 2) (<= 2 main_~z~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; {40981#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:30,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {40981#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {40965#false} 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; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {40965#false} assume !(~y~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {40965#false} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-28 10:10:30,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-28 10:10:30,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-28 10:10:30,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-28 10:10:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:10:30,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:30,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969721348] [2022-04-28 10:10:30,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969721348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:30,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63945054] [2022-04-28 10:10:30,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:30,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:30,167 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:30,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:10:30,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:30,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:30,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:10:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:30,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#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); {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40964#true} is VALID [2022-04-28 10:10:30,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:30,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:30,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:30,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:30,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {41023#(< 0 (mod (+ 5 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; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:30,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 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; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:30,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 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; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:30,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 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; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:30,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-28 10:10:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:10:30,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:30,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-28 10:10:30,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-28 10:10:30,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-28 10:10:30,502 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-28 10:10:30,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-28 10:10:30,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-28 10:10:30,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {41045#(< 0 (mod main_~x~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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 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; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:30,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 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; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:30,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 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; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:30,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 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; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:30,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {41023#(< 0 (mod (+ 5 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; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:30,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:30,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:30,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:30,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:30,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:30,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#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); {40964#true} is VALID [2022-04-28 10:10:30,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40964#true} is VALID [2022-04-28 10:10:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:10:30,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63945054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:30,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:30,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:10:30,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:30,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531265758] [2022-04-28 10:10:30,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531265758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:30,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:30,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:10:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126989401] [2022-04-28 10:10:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 34 [2022-04-28 10:10:30,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:30,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:10:30,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:30,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:10:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:30,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:10:30,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:10:30,532 INFO L87 Difference]: Start difference. First operand 215 states and 275 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:10:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:33,545 INFO L93 Difference]: Finished difference Result 314 states and 401 transitions. [2022-04-28 10:10:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:10:33,545 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 34 [2022-04-28 10:10:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:10:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2022-04-28 10:10:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:10:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2022-04-28 10:10:33,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 107 transitions. [2022-04-28 10:10:33,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:33,680 INFO L225 Difference]: With dead ends: 314 [2022-04-28 10:10:33,680 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 10:10:33,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:10:33,681 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 54 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:33,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 85 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 10:10:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2022-04-28 10:10:34,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:34,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 10:10:34,448 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 10:10:34,448 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 10:10:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,451 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2022-04-28 10:10:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2022-04-28 10:10:34,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 287 states. [2022-04-28 10:10:34,452 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 287 states. [2022-04-28 10:10:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,455 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2022-04-28 10:10:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2022-04-28 10:10:34,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:34,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 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 10:10:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2022-04-28 10:10:34,458 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 34 [2022-04-28 10:10:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:34,458 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2022-04-28 10:10:34,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:10:34,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 275 transitions. [2022-04-28 10:10:35,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-04-28 10:10:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:35,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:35,425 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:35,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 10:10:35,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 10:10:35,626 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 39 times [2022-04-28 10:10:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [644411599] [2022-04-28 10:10:35,628 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:35,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 40 times [2022-04-28 10:10:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238908905] [2022-04-28 10:10:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {42886#(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); {42870#true} is VALID [2022-04-28 10:10:35,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:35,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {42886#(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); {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-28 10:10:35,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42875#(= main_~y~0 0)} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {42875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:35,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:35,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:35,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:35,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:35,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:35,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:35,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:35,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {42883#(and (<= main_~z~0 7) (<= 7 main_~z~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; {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:35,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {42884#(and (<= main_~z~0 6) (<= 6 main_~z~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; {42885#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:35,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {42885#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:35,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-28 10:10:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:10:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:35,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238908905] [2022-04-28 10:10:35,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238908905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:35,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339021033] [2022-04-28 10:10:35,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:35,798 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:35,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:10:35,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:35,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:35,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:10:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:36,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42870#true} is VALID [2022-04-28 10:10:36,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#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); {42870#true} is VALID [2022-04-28 10:10:36,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-28 10:10:36,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-28 10:10:36,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-28 10:10:36,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42875#(= main_~y~0 0)} is VALID [2022-04-28 10:10:36,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {42875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:36,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:36,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:36,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:36,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:36,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:36,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:36,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:36,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:36,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {42883#(and (<= main_~z~0 7) (<= 7 main_~z~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; {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:36,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {42884#(and (<= main_~z~0 6) (<= 6 main_~z~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; {42938#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {42938#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-28 10:10:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:10:36,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} 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; {42871#false} is VALID [2022-04-28 10:10:36,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {43038#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-28 10:10:36,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {43042#(< 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; {43038#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {43046#(< 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; {43042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:36,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {43046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:36,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:36,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {43057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:36,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {43061#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:36,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {43065#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43061#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:36,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {43069#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {43073#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:36,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {43077#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {43081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:36,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-28 10:10:36,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-28 10:10:36,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#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); {42870#true} is VALID [2022-04-28 10:10:36,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42870#true} is VALID [2022-04-28 10:10:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:10:36,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339021033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:36,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:36,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:10:36,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [644411599] [2022-04-28 10:10:36,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [644411599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:36,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:36,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:10:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438620823] [2022-04-28 10:10:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 34 [2022-04-28 10:10:36,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:36,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:36,359 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 10:10:36,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:10:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:10:36,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:10:36,360 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,703 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2022-04-28 10:10:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:10:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 34 [2022-04-28 10:10:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-28 10:10:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-28 10:10:39,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2022-04-28 10:10:39,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:39,789 INFO L225 Difference]: With dead ends: 340 [2022-04-28 10:10:39,789 INFO L226 Difference]: Without dead ends: 323 [2022-04-28 10:10:39,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:10:39,790 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:39,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:10:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-28 10:10:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 216. [2022-04-28 10:10:40,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:40,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 10:10:40,584 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 10:10:40,584 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 10:10:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:40,588 INFO L93 Difference]: Finished difference Result 323 states and 409 transitions. [2022-04-28 10:10:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 409 transitions. [2022-04-28 10:10:40,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:40,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:40,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 323 states. [2022-04-28 10:10:40,589 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 323 states. [2022-04-28 10:10:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:40,593 INFO L93 Difference]: Finished difference Result 323 states and 409 transitions. [2022-04-28 10:10:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 409 transitions. [2022-04-28 10:10:40,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:40,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:40,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:40,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 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 10:10:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2022-04-28 10:10:40,596 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 34 [2022-04-28 10:10:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:40,596 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2022-04-28 10:10:40,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 10:10:40,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 274 transitions. [2022-04-28 10:10:41,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2022-04-28 10:10:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:41,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:41,420 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:41,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:41,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 10:10:41,621 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2033395314, now seen corresponding path program 41 times [2022-04-28 10:10:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:41,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1134014390] [2022-04-28 10:10:41,623 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:41,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2033395314, now seen corresponding path program 42 times [2022-04-28 10:10:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:41,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590083007] [2022-04-28 10:10:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {44911#(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); {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:41,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {44911#(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); {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-28 10:10:41,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-28 10:10:41,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44893#(= main_~y~0 0)} is VALID [2022-04-28 10:10:41,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {44893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:41,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {44894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:41,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {44895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:41,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {44896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:41,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {44897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:41,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {44898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:41,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {44899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:41,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {44900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:41,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {44901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:41,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {44902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44903#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:41,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {44903#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44904#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:41,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {44904#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44905#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:41,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {44905#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44906#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:41,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {44906#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44907#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:41,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {44907#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:41,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:41,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {44909#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:10:41,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {44909#(and (<= main_~z~0 15) (<= 15 main_~z~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; {44910#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {44910#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {44889#false} 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; {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {44889#false} assume !(~y~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {44889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {44889#false} assume !(~x~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {44889#false} assume !(~z~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L272 TraceCheckUtils]: 30: Hoare triple {44889#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {44889#false} ~cond := #in~cond; {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {44889#false} assume 0 == ~cond; {44889#false} is VALID [2022-04-28 10:10:41,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-28 10:10:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590083007] [2022-04-28 10:10:41,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590083007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656168903] [2022-04-28 10:10:41,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:41,921 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:10:41,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:41,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:41,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:10:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:42,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#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); {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {44888#true} assume !(~x~0 % 4294967296 > 0); {44888#true} is VALID [2022-04-28 10:10:42,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {44888#true} ~z~0 := ~y~0; {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:42,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {44981#(= 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; {44985#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:10:42,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {44985#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {44985#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:10:42,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {44985#(= 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; {44992#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:10:42,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {44992#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {44992#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:10:42,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {44992#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:42,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {44981#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:42,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {44981#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {45005#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:42,227 INFO L272 TraceCheckUtils]: 30: Hoare triple {45005#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:42,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:42,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {45013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44889#false} is VALID [2022-04-28 10:10:42,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-28 10:10:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:10:42,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:42,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-28 10:10:42,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {45013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44889#false} is VALID [2022-04-28 10:10:42,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:42,459 INFO L272 TraceCheckUtils]: 30: Hoare triple {45005#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:42,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {45005#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:42,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:42,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:42,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:10:42,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:10:42,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:10:42,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:10:42,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {44888#true} ~z~0 := ~y~0; {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:42,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {44888#true} assume !(~x~0 % 4294967296 > 0); {44888#true} is VALID [2022-04-28 10:10:42,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-28 10:10:42,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#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); {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44888#true} is VALID [2022-04-28 10:10:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:10:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656168903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:42,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:42,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 30 [2022-04-28 10:10:42,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1134014390] [2022-04-28 10:10:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1134014390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:42,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:42,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:10:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13395590] [2022-04-28 10:10:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 34 [2022-04-28 10:10:42,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:42,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:10:42,484 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 10:10:42,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:10:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:10:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:10:42,485 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:10:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:49,989 INFO L93 Difference]: Finished difference Result 485 states and 676 transitions. [2022-04-28 10:10:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:10:49,989 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 34 [2022-04-28 10:10:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:10:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 210 transitions. [2022-04-28 10:10:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:10:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 210 transitions. [2022-04-28 10:10:49,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 210 transitions. [2022-04-28 10:10:50,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:50,155 INFO L225 Difference]: With dead ends: 485 [2022-04-28 10:10:50,155 INFO L226 Difference]: Without dead ends: 462 [2022-04-28 10:10:50,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:10:50,156 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:50,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 185 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:10:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-28 10:10:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 228. [2022-04-28 10:10:50,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:50,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 10:10:50,979 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 10:10:50,980 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 10:10:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:50,987 INFO L93 Difference]: Finished difference Result 462 states and 585 transitions. [2022-04-28 10:10:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 585 transitions. [2022-04-28 10:10:50,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:50,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:50,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 462 states. [2022-04-28 10:10:50,988 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 462 states. [2022-04-28 10:10:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:50,995 INFO L93 Difference]: Finished difference Result 462 states and 585 transitions. [2022-04-28 10:10:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 585 transitions. [2022-04-28 10:10:50,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:50,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:50,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:50,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 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 10:10:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 291 transitions. [2022-04-28 10:10:50,999 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 291 transitions. Word has length 34 [2022-04-28 10:10:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:50,999 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 291 transitions. [2022-04-28 10:10:50,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:10:50,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 291 transitions. [2022-04-28 10:10:51,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-28 10:10:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:51,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:51,932 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:51,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 10:10:52,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 10:10:52,132 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -879664127, now seen corresponding path program 21 times [2022-04-28 10:10:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [83878734] [2022-04-28 10:10:52,135 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:52,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -879664127, now seen corresponding path program 22 times [2022-04-28 10:10:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:52,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113710009] [2022-04-28 10:10:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:52,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {47532#(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); {47512#true} is VALID [2022-04-28 10:10:52,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-28 10:10:52,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-28 10:10:52,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:52,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {47532#(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); {47512#true} is VALID [2022-04-28 10:10:52,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-28 10:10:52,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-28 10:10:52,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-28 10:10:52,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47517#(= main_~y~0 0)} is VALID [2022-04-28 10:10:52,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {47517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:52,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {47518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:52,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {47519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:52,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {47520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:52,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {47521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:52,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {47522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:52,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:52,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:52,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~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; {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:52,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {47525#(and (<= main_~z~0 5) (<= 5 main_~z~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; {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:52,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:52,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {47527#(and (<= main_~z~0 3) (<= 3 main_~z~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; {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:52,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {47528#(and (<= main_~z~0 2) (<= 2 main_~z~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; {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:52,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {47529#(and (<= main_~z~0 1) (<= 1 main_~z~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; {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:52,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:52,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {47530#(and (<= main_~z~0 0) (<= 0 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; {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:52,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {47529#(and (<= main_~z~0 1) (<= 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; {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:52,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {47528#(and (<= main_~z~0 2) (<= 2 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; {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:52,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {47527#(and (<= main_~z~0 3) (<= 3 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; {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:52,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {47526#(and (<= 4 main_~z~0) (<= main_~z~0 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; {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:52,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {47525#(and (<= main_~z~0 5) (<= 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; {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:52,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:52,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:52,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47531#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:52,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {47531#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-28 10:10:52,385 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-28 10:10:52,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-28 10:10:52,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-28 10:10:52,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-28 10:10:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113710009] [2022-04-28 10:10:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113710009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828520803] [2022-04-28 10:10:52,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:52,387 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:52,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:10:52,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:52,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:52,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:10:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:52,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:52,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47512#true} is VALID [2022-04-28 10:10:52,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#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); {47512#true} is VALID [2022-04-28 10:10:52,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-28 10:10:52,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-28 10:10:52,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-28 10:10:52,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47512#true} is VALID [2022-04-28 10:10:52,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {47512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:52,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:52,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:52,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:52,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:52,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 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; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:52,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {47570#(< 0 (mod (+ 5 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; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:52,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 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; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:52,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 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; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:52,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 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; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:52,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {47513#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {47513#false} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-28 10:10:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:10:52,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:52,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-28 10:10:52,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-28 10:10:52,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-28 10:10:52,752 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-28 10:10:52,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {47513#false} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-28 10:10:52,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {47513#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47513#false} is VALID [2022-04-28 10:10:52,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-28 10:10:52,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {47599#(< 0 (mod main_~x~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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 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; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:52,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 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; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:52,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 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; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:52,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 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; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:52,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {47570#(< 0 (mod (+ 5 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; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:52,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 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; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:52,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:10:52,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:52,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:52,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:52,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:52,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {47512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:52,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#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); {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47512#true} is VALID [2022-04-28 10:10:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:10:52,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828520803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:52,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:52,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:10:52,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [83878734] [2022-04-28 10:10:52,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [83878734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:52,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:52,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:10:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198496413] [2022-04-28 10:10:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 35 [2022-04-28 10:10:52,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:52,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 10:10:52,791 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 10:10:52,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:10:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:10:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:10:52,791 INFO L87 Difference]: Start difference. First operand 228 states and 291 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 10:10:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:58,568 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2022-04-28 10:10:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 10:10:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 35 [2022-04-28 10:10:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 10:10:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 211 transitions. [2022-04-28 10:10:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 10:10:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 211 transitions. [2022-04-28 10:10:58,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 211 transitions. [2022-04-28 10:10:58,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:58,743 INFO L225 Difference]: With dead ends: 341 [2022-04-28 10:10:58,743 INFO L226 Difference]: Without dead ends: 324 [2022-04-28 10:10:58,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=457, Invalid=7025, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 10:10:58,744 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:58,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 106 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:10:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-28 10:10:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 237. [2022-04-28 10:10:59,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:59,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 10:10:59,661 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 10:10:59,661 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 10:10:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,665 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-04-28 10:10:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2022-04-28 10:10:59,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 324 states. [2022-04-28 10:10:59,666 INFO L87 Difference]: Start difference. First operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 324 states. [2022-04-28 10:10:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,670 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-04-28 10:10:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2022-04-28 10:10:59,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:59,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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 10:10:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2022-04-28 10:10:59,673 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 35 [2022-04-28 10:10:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:59,673 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2022-04-28 10:10:59,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 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 10:10:59,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 300 transitions. [2022-04-28 10:11:00,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-28 10:11:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:11:00,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:00,826 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:00,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:01,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:11:01,042 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:01,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1905241537, now seen corresponding path program 43 times [2022-04-28 10:11:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:01,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264226440] [2022-04-28 10:11:01,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:01,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1905241537, now seen corresponding path program 44 times [2022-04-28 10:11:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:01,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838159388] [2022-04-28 10:11:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:01,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {49701#(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); {49677#true} is VALID [2022-04-28 10:11:01,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-28 10:11:01,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-28 10:11:01,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:01,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {49701#(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); {49677#true} is VALID [2022-04-28 10:11:01,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-28 10:11:01,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-28 10:11:01,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-28 10:11:01,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49682#(= main_~y~0 0)} is VALID [2022-04-28 10:11:01,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {49682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:01,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:01,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:01,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:01,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:01,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:01,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:01,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:01,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:01,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:01,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:01,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:01,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:01,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:01,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:01,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:01,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:01,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} 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; {49700#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {49700#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} 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; {49678#false} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,374 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-28 10:11:01,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-28 10:11:01,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-28 10:11:01,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-28 10:11:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838159388] [2022-04-28 10:11:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838159388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728917512] [2022-04-28 10:11:01,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:01,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:01,375 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:01,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:11:01,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:01,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:01,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:11:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:01,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:01,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49677#true} is VALID [2022-04-28 10:11:01,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#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); {49677#true} is VALID [2022-04-28 10:11:01,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-28 10:11:01,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-28 10:11:01,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-28 10:11:01,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49682#(= main_~y~0 0)} is VALID [2022-04-28 10:11:01,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {49682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:01,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:01,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:01,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:01,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:01,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:01,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:01,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:01,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:01,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:01,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:01,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:01,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:01,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:01,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:01,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:01,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:01,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:11:01,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} 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; {49777#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:01,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {49777#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} 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; {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-28 10:11:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:01,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:02,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-28 10:11:02,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-28 10:11:02,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-28 10:11:02,307 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-28 10:11:02,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:02,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:02,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-28 10:11:02,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:02,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} 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; {49678#false} is VALID [2022-04-28 10:11:02,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {49835#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-28 10:11:02,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {49839#(< 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; {49835#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:02,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {49839#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:02,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:02,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {49850#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:02,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {49854#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49850#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:02,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {49858#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49854#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:02,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {49862#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49858#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:02,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {49866#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49862#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:02,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {49870#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49866#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:02,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {49874#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49870#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {49878#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49874#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:02,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {49882#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49878#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {49886#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49882#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:02,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49886#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:02,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {49894#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49890#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:02,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {49898#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49894#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:02,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {49902#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49898#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:02,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {49906#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49902#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:02,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {49910#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49906#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:02,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49910#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:02,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-28 10:11:02,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-28 10:11:02,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-28 10:11:02,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#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); {49677#true} is VALID [2022-04-28 10:11:02,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49677#true} is VALID [2022-04-28 10:11:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:02,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728917512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:02,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:11:02,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:02,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264226440] [2022-04-28 10:11:02,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264226440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:02,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:11:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443933081] [2022-04-28 10:11:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 35 [2022-04-28 10:11:02,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:02,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:11:02,348 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 10:11:02,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:11:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:11:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:11:02,349 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:11:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,474 INFO L93 Difference]: Finished difference Result 555 states and 776 transitions. [2022-04-28 10:11:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:11:11,474 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 35 [2022-04-28 10:11:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:11:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 222 transitions. [2022-04-28 10:11:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:11:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 222 transitions. [2022-04-28 10:11:11,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 222 transitions. [2022-04-28 10:11:11,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:11,650 INFO L225 Difference]: With dead ends: 555 [2022-04-28 10:11:11,650 INFO L226 Difference]: Without dead ends: 532 [2022-04-28 10:11:11,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:11:11,651 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 163 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:11,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 194 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:11:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-28 10:11:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 249. [2022-04-28 10:11:12,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:12,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 10:11:12,578 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 10:11:12,578 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 10:11:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:12,587 INFO L93 Difference]: Finished difference Result 532 states and 681 transitions. [2022-04-28 10:11:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 681 transitions. [2022-04-28 10:11:12,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:12,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:12,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 532 states. [2022-04-28 10:11:12,588 INFO L87 Difference]: Start difference. First operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 532 states. [2022-04-28 10:11:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:12,597 INFO L93 Difference]: Finished difference Result 532 states and 681 transitions. [2022-04-28 10:11:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 681 transitions. [2022-04-28 10:11:12,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:12,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:12,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:12,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 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 10:11:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2022-04-28 10:11:12,600 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 35 [2022-04-28 10:11:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:12,600 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2022-04-28 10:11:12,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:11:12,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 317 transitions. [2022-04-28 10:11:13,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2022-04-28 10:11:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:13,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:13,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:13,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:13,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:13,868 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 13 times [2022-04-28 10:11:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:13,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774166335] [2022-04-28 10:11:13,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:13,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 14 times [2022-04-28 10:11:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736084880] [2022-04-28 10:11:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {52656#(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); {52643#true} is VALID [2022-04-28 10:11:14,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-28 10:11:14,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-28 10:11:14,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:14,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {52656#(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); {52643#true} is VALID [2022-04-28 10:11:14,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-28 10:11:14,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-28 10:11:14,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-28 10:11:14,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 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; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~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; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~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; {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {52648#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:11:14,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:11:14,049 INFO L272 TraceCheckUtils]: 32: Hoare triple {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52654#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:11:14,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {52654#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {52655#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:11:14,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {52655#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {52644#false} is VALID [2022-04-28 10:11:14,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-28 10:11:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:11:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:14,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736084880] [2022-04-28 10:11:14,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736084880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:14,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810787852] [2022-04-28 10:11:14,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:14,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:14,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:14,052 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:14,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:11:14,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:14,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:14,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:11:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:14,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52643#true} is VALID [2022-04-28 10:11:14,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#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); {52643#true} is VALID [2022-04-28 10:11:14,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-28 10:11:14,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-28 10:11:14,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-28 10:11:14,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {52693#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {52693#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 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; {52697#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:14,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {52697#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= 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; {52701#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {52701#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 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; {52705#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {52705#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 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; {52709#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:11:14,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {52709#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 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; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 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; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~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; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~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; {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {52648#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {52648#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,447 INFO L272 TraceCheckUtils]: 32: Hoare triple {52648#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:14,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:14,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {52765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52644#false} is VALID [2022-04-28 10:11:14,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-28 10:11:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:14,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:14,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-28 10:11:14,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {52765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52644#false} is VALID [2022-04-28 10:11:14,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:14,731 INFO L272 TraceCheckUtils]: 32: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:14,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:11:14,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:11:14,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:11:14,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:11:14,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:11:14,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-28 10:11:14,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-28 10:11:14,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:11:14,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:11:14,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:11:14,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:11:14,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 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; {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:11:14,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 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; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:11:14,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 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; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:11:14,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~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; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-28 10:11:14,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {52834#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-28 10:11:14,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {52838#(or (= (mod (+ 4294967292 main_~y~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; {52834#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:11:14,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {52842#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 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; {52838#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:14,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {52846#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 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; {52842#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:14,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {52850#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 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; {52846#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:14,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {52643#true} ~z~0 := ~y~0; {52850#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:14,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {52643#true} assume !(~x~0 % 4294967296 > 0); {52643#true} is VALID [2022-04-28 10:11:14,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#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); {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52643#true} is VALID [2022-04-28 10:11:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:11:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810787852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:14,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:14,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 28 [2022-04-28 10:11:14,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:14,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774166335] [2022-04-28 10:11:14,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774166335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:14,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:14,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:11:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210807613] [2022-04-28 10:11:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 36 [2022-04-28 10:11:14,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:14,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 10:11:14,767 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 10:11:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:11:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:11:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:14,768 INFO L87 Difference]: Start difference. First operand 249 states and 317 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 10:11:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,255 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2022-04-28 10:11:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:11:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 36 [2022-04-28 10:11:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 10:11:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:11:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 10:11:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:11:16,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 10:11:16,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:16,295 INFO L225 Difference]: With dead ends: 260 [2022-04-28 10:11:16,295 INFO L226 Difference]: Without dead ends: 250 [2022-04-28 10:11:16,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:11:16,296 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:16,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:11:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-28 10:11:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-04-28 10:11:17,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:17,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 10:11:17,266 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 10:11:17,266 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 10:11:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,269 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2022-04-28 10:11:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-28 10:11:17,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:17,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:17,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 250 states. [2022-04-28 10:11:17,269 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 250 states. [2022-04-28 10:11:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,272 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2022-04-28 10:11:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-28 10:11:17,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:17,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:17,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:17,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 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 10:11:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-04-28 10:11:17,276 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 36 [2022-04-28 10:11:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:17,276 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-04-28 10:11:17,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 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 10:11:17,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 318 transitions. [2022-04-28 10:11:18,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-28 10:11:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:18,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:18,310 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:18,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 10:11:18,510 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 23 times [2022-04-28 10:11:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143797097] [2022-04-28 10:11:18,513 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:18,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 24 times [2022-04-28 10:11:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:18,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099373466] [2022-04-28 10:11:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:18,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:18,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {54438#(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); {54423#true} is VALID [2022-04-28 10:11:18,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-28 10:11:18,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-28 10:11:18,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:18,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {54438#(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); {54423#true} is VALID [2022-04-28 10:11:18,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-28 10:11:18,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-28 10:11:18,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-28 10:11:18,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-28 10:11:18,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:18,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54429#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:11:18,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {54429#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54430#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:18,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {54430#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54431#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:18,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {54431#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:18,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:18,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:18,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 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; {54433#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:11:18,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {54433#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 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; {54434#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:11:18,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {54434#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) 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; {54435#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:18,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {54435#(<= (+ 3 (* (div (+ main_~x~0 2) 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; {54436#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:11:18,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {54436#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) 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; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-28 10:11:18,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-28 10:11:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099373466] [2022-04-28 10:11:18,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099373466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407321991] [2022-04-28 10:11:18,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:18,685 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:18,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:11:18,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:11:18,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:18,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:11:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:18,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:19,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54423#true} is VALID [2022-04-28 10:11:19,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#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); {54423#true} is VALID [2022-04-28 10:11:19,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-28 10:11:19,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-28 10:11:19,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-28 10:11:19,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-28 10:11:19,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:19,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:19,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:19,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:19,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:19,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:19,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:19,105 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-28 10:11:19,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-28 10:11:19,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-28 10:11:19,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-28 10:11:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:19,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:19,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-28 10:11:19,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-28 10:11:19,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 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; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:19,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:19,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:19,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:19,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:19,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:19,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:19,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#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); {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54423#true} is VALID [2022-04-28 10:11:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407321991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:19,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:19,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:11:19,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:19,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143797097] [2022-04-28 10:11:19,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143797097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:19,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:19,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:11:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882805803] [2022-04-28 10:11:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:19,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:19,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 10:11:19,254 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 10:11:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:11:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:11:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:11:19,255 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 10:11:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:21,306 INFO L93 Difference]: Finished difference Result 312 states and 411 transitions. [2022-04-28 10:11:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:11:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 10:11:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 10:11:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 10:11:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 10:11:21,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 10:11:21,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:21,382 INFO L225 Difference]: With dead ends: 312 [2022-04-28 10:11:21,382 INFO L226 Difference]: Without dead ends: 299 [2022-04-28 10:11:21,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:21,383 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:21,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:11:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-28 10:11:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 286. [2022-04-28 10:11:22,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:22,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 10:11:22,589 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 10:11:22,589 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 10:11:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:22,592 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2022-04-28 10:11:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2022-04-28 10:11:22,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:22,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:22,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 299 states. [2022-04-28 10:11:22,593 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 299 states. [2022-04-28 10:11:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:22,597 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2022-04-28 10:11:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2022-04-28 10:11:22,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:22,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:22,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:22,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 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 10:11:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 366 transitions. [2022-04-28 10:11:22,601 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 366 transitions. Word has length 36 [2022-04-28 10:11:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:22,601 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 366 transitions. [2022-04-28 10:11:22,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 10:11:22,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 366 transitions. [2022-04-28 10:11:24,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 366 transitions. [2022-04-28 10:11:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:24,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:24,224 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:24,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 10:11:24,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 10:11:24,425 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1644820974, now seen corresponding path program 45 times [2022-04-28 10:11:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:24,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209054604] [2022-04-28 10:11:24,428 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:24,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1644820974, now seen corresponding path program 46 times [2022-04-28 10:11:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:24,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391903445] [2022-04-28 10:11:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:24,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {56490#(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); {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:24,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {56490#(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); {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-28 10:11:24,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-28 10:11:24,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56478#(= main_~y~0 0)} is VALID [2022-04-28 10:11:24,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {56478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:24,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:24,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:24,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:24,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:24,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:24,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:24,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:24,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:24,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {56486#(and (<= main_~z~0 7) (<= 7 main_~z~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; {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:24,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {56487#(and (<= main_~z~0 6) (<= 6 main_~z~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; {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {56488#(and (<= main_~z~0 5) (<= 5 main_~z~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; {56489#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {56489#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-28 10:11:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391903445] [2022-04-28 10:11:24,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391903445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:24,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415442415] [2022-04-28 10:11:24,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:24,625 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:24,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 10:11:24,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:24,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:24,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:11:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:24,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:24,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56473#true} is VALID [2022-04-28 10:11:24,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#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); {56473#true} is VALID [2022-04-28 10:11:24,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-28 10:11:24,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-28 10:11:24,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-28 10:11:24,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56478#(= main_~y~0 0)} is VALID [2022-04-28 10:11:24,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {56478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:24,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:24,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:24,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:24,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:24,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:24,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:24,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:24,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:24,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {56486#(and (<= main_~z~0 7) (<= 7 main_~z~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; {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:24,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {56487#(and (<= main_~z~0 6) (<= 6 main_~z~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; {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:24,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {56488#(and (<= main_~z~0 5) (<= 5 main_~z~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; {56545#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {56545#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-28 10:11:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:24,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:25,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} 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; {56474#false} is VALID [2022-04-28 10:11:25,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-28 10:11:25,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {56655#(< 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; {56651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:25,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {56659#(< 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; {56655#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:25,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {56663#(< 0 (mod (+ main_~z~0 4294967293) 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; {56659#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:25,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {56663#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:25,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:25,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {56674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:25,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {56678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:25,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {56682#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:25,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {56686#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56682#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:25,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {56690#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56686#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:25,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {56694#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56690#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:25,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {56698#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56694#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:25,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56698#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:25,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-28 10:11:25,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-28 10:11:25,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-28 10:11:25,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#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); {56473#true} is VALID [2022-04-28 10:11:25,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56473#true} is VALID [2022-04-28 10:11:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:25,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415442415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:25,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:11:25,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:25,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209054604] [2022-04-28 10:11:25,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209054604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:25,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:11:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933265470] [2022-04-28 10:11:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:25,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:25,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:25,200 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 10:11:25,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:11:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:11:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:25,201 INFO L87 Difference]: Start difference. First operand 286 states and 366 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:29,456 INFO L93 Difference]: Finished difference Result 422 states and 532 transitions. [2022-04-28 10:11:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:11:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-28 10:11:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-28 10:11:29,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-28 10:11:29,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:29,545 INFO L225 Difference]: With dead ends: 422 [2022-04-28 10:11:29,545 INFO L226 Difference]: Without dead ends: 404 [2022-04-28 10:11:29,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:29,546 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:29,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 100 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:11:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-04-28 10:11:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 286. [2022-04-28 10:11:30,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:30,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 10:11:30,753 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 10:11:30,753 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 10:11:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:30,759 INFO L93 Difference]: Finished difference Result 404 states and 513 transitions. [2022-04-28 10:11:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 513 transitions. [2022-04-28 10:11:30,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:30,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:30,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 404 states. [2022-04-28 10:11:30,760 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 404 states. [2022-04-28 10:11:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:30,766 INFO L93 Difference]: Finished difference Result 404 states and 513 transitions. [2022-04-28 10:11:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 513 transitions. [2022-04-28 10:11:30,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:30,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:30,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:30,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 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 10:11:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2022-04-28 10:11:30,770 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 36 [2022-04-28 10:11:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:30,770 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2022-04-28 10:11:30,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:30,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 365 transitions. [2022-04-28 10:11:32,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2022-04-28 10:11:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:32,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:32,215 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:32,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-28 10:11:32,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 10:11:32,416 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 47 times [2022-04-28 10:11:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025359347] [2022-04-28 10:11:32,418 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:32,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 48 times [2022-04-28 10:11:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:32,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086366132] [2022-04-28 10:11:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:32,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {58996#(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); {58979#true} is VALID [2022-04-28 10:11:32,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-28 10:11:32,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-28 10:11:32,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:32,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {58996#(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); {58979#true} is VALID [2022-04-28 10:11:32,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-28 10:11:32,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-28 10:11:32,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-28 10:11:32,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58984#(= main_~y~0 0)} is VALID [2022-04-28 10:11:32,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {58984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:32,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:32,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:32,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:32,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:32,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:32,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:32,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:32,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:32,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:32,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:32,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {58994#(and (<= main_~z~0 7) (<= 7 main_~z~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; {58995#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {58995#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-28 10:11:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:11:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086366132] [2022-04-28 10:11:32,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086366132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545148432] [2022-04-28 10:11:32,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:32,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:32,584 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:32,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 10:11:32,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:11:32,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:32,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:11:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:32,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58979#true} is VALID [2022-04-28 10:11:32,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#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); {58979#true} is VALID [2022-04-28 10:11:32,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-28 10:11:32,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-28 10:11:32,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-28 10:11:32,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58984#(= main_~y~0 0)} is VALID [2022-04-28 10:11:32,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {58984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:32,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:32,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:32,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:32,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:32,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:32,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:32,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:32,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:32,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:32,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:32,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {58994#(and (<= main_~z~0 7) (<= 7 main_~z~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; {59051#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:32,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {59051#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-28 10:11:32,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-28 10:11:32,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-28 10:11:32,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-28 10:11:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:11:32,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:33,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-28 10:11:33,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-28 10:11:33,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} 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; {58980#false} is VALID [2022-04-28 10:11:33,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {59157#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-28 10:11:33,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {59161#(< 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; {59157#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:33,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {59165#(< 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; {59161#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:33,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {59165#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:33,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:33,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {59176#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:33,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {59180#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59176#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:33,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {59184#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59180#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:33,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {59188#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59184#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:33,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {59192#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59188#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:33,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {59196#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59192#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:33,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {59200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59196#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:33,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {59204#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:33,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59204#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:33,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-28 10:11:33,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-28 10:11:33,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-28 10:11:33,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#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); {58979#true} is VALID [2022-04-28 10:11:33,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58979#true} is VALID [2022-04-28 10:11:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:11:33,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545148432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:33,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:33,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:11:33,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:33,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025359347] [2022-04-28 10:11:33,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025359347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:33,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:33,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:11:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53870705] [2022-04-28 10:11:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:33,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:33,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:33,206 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 10:11:33,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:11:33,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:33,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:11:33,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:33,206 INFO L87 Difference]: Start difference. First operand 286 states and 365 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:37,893 INFO L93 Difference]: Finished difference Result 451 states and 565 transitions. [2022-04-28 10:11:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:11:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 36 [2022-04-28 10:11:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-28 10:11:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-28 10:11:37,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 121 transitions. [2022-04-28 10:11:37,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:37,999 INFO L225 Difference]: With dead ends: 451 [2022-04-28 10:11:37,999 INFO L226 Difference]: Without dead ends: 433 [2022-04-28 10:11:38,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:11:38,000 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:38,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 102 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:11:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-04-28 10:11:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 286. [2022-04-28 10:11:39,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:39,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 10:11:39,238 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 10:11:39,239 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 10:11:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:39,245 INFO L93 Difference]: Finished difference Result 433 states and 546 transitions. [2022-04-28 10:11:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2022-04-28 10:11:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:39,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:39,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 433 states. [2022-04-28 10:11:39,246 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 433 states. [2022-04-28 10:11:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:39,253 INFO L93 Difference]: Finished difference Result 433 states and 546 transitions. [2022-04-28 10:11:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2022-04-28 10:11:39,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:39,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:39,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:39,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 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 10:11:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2022-04-28 10:11:39,258 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 36 [2022-04-28 10:11:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:39,258 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2022-04-28 10:11:39,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 10:11:39,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 364 transitions. [2022-04-28 10:11:40,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2022-04-28 10:11:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:40,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:40,644 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:40,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:40,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:40,844 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 551067666, now seen corresponding path program 49 times [2022-04-28 10:11:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:40,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525511779] [2022-04-28 10:11:40,847 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:40,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 551067666, now seen corresponding path program 50 times [2022-04-28 10:11:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:40,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369586851] [2022-04-28 10:11:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {61620#(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); {61595#true} is VALID [2022-04-28 10:11:41,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-28 10:11:41,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-28 10:11:41,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:41,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {61620#(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); {61595#true} is VALID [2022-04-28 10:11:41,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-28 10:11:41,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-28 10:11:41,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-28 10:11:41,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61600#(= main_~y~0 0)} is VALID [2022-04-28 10:11:41,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {61600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:41,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:41,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:41,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:41,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:41,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:41,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:41,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:41,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:41,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:41,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:41,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:41,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:41,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:41,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:41,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:41,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:41,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:41,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:11:41,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} 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; {61619#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {61619#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} 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; {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-28 10:11:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369586851] [2022-04-28 10:11:41,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369586851] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839932617] [2022-04-28 10:11:41,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:41,184 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:41,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 10:11:41,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:41,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:41,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:11:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:41,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:41,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61595#true} is VALID [2022-04-28 10:11:41,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#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); {61595#true} is VALID [2022-04-28 10:11:41,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-28 10:11:41,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-28 10:11:41,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-28 10:11:41,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61600#(= main_~y~0 0)} is VALID [2022-04-28 10:11:41,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {61600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:41,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:41,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:41,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:41,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:41,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:41,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:41,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:41,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:41,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:41,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:41,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:41,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:41,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:41,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:41,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:41,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:41,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:41,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} 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; {61699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {61699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} 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; {61596#false} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-28 10:11:41,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-28 10:11:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:41,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:42,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-28 10:11:42,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:42,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} 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; {61596#false} is VALID [2022-04-28 10:11:42,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {61757#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-28 10:11:42,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {61761#(< 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; {61757#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:42,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {61761#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:42,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:42,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {61772#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:42,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {61776#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61772#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:42,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {61780#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61776#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:42,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {61784#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61780#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:42,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {61788#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61784#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:42,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {61792#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61788#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:42,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {61796#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61792#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:42,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {61800#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61796#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:42,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {61804#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61800#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:42,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {61808#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61804#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:42,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {61812#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61808#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:42,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {61816#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61812#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:42,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {61820#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61816#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:42,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {61824#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61820#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:42,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {61828#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61824#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:42,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {61832#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61828#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:42,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {61836#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61832#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:42,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61836#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:42,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-28 10:11:42,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-28 10:11:42,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-28 10:11:42,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#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); {61595#true} is VALID [2022-04-28 10:11:42,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61595#true} is VALID [2022-04-28 10:11:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:11:42,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839932617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:42,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:42,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:11:42,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:42,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525511779] [2022-04-28 10:11:42,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525511779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:42,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:42,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:11:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896263380] [2022-04-28 10:11:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 36 [2022-04-28 10:11:42,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:42,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 10:11:42,254 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 10:11:42,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:11:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:11:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:42,255 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 10:11:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,744 INFO L93 Difference]: Finished difference Result 641 states and 899 transitions. [2022-04-28 10:11:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:11:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 36 [2022-04-28 10:11:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 10:11:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 234 transitions. [2022-04-28 10:11:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 10:11:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 234 transitions. [2022-04-28 10:11:52,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 234 transitions. [2022-04-28 10:11:52,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:52,945 INFO L225 Difference]: With dead ends: 641 [2022-04-28 10:11:52,945 INFO L226 Difference]: Without dead ends: 616 [2022-04-28 10:11:52,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=889, Invalid=3271, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:11:52,946 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 173 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:52,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 200 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:11:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-28 10:11:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 300. [2022-04-28 10:11:54,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:54,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 10:11:54,249 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 10:11:54,249 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 10:11:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:54,260 INFO L93 Difference]: Finished difference Result 616 states and 780 transitions. [2022-04-28 10:11:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 780 transitions. [2022-04-28 10:11:54,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:54,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:54,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 616 states. [2022-04-28 10:11:54,261 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 616 states. [2022-04-28 10:11:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:54,277 INFO L93 Difference]: Finished difference Result 616 states and 780 transitions. [2022-04-28 10:11:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 780 transitions. [2022-04-28 10:11:54,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:54,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:54,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:54,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 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 10:11:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 384 transitions. [2022-04-28 10:11:54,282 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 384 transitions. Word has length 36 [2022-04-28 10:11:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:54,282 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 384 transitions. [2022-04-28 10:11:54,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 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 10:11:54,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 384 transitions. [2022-04-28 10:11:56,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 384 transitions. [2022-04-28 10:11:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:11:56,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:56,002 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:56,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 10:11:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:56,203 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 15 times [2022-04-28 10:11:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985818085] [2022-04-28 10:11:56,205 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:56,205 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 16 times [2022-04-28 10:11:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694784930] [2022-04-28 10:11:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {65023#(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); {65013#true} is VALID [2022-04-28 10:11:56,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-28 10:11:56,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-28 10:11:56,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {65023#(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); {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= 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; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= 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; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= 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; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-28 10:11:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:56,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694784930] [2022-04-28 10:11:56,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694784930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:56,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984145933] [2022-04-28 10:11:56,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:56,297 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:56,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 10:11:56,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:56,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:56,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:11:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:56,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65013#true} is VALID [2022-04-28 10:11:56,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#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); {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= 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; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= 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; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= 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; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-28 10:11:56,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-28 10:11:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:56,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-28 10:11:56,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-28 10:11:56,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-28 10:11:56,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= 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; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= 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; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= 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; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:56,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= 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; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:56,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#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); {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65013#true} is VALID [2022-04-28 10:11:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:56,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984145933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:56,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-28 10:11:56,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:56,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985818085] [2022-04-28 10:11:56,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985818085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:56,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:11:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54792996] [2022-04-28 10:11:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 37 [2022-04-28 10:11:56,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:56,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 10:11:56,703 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 10:11:56,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:11:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:11:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:11:56,704 INFO L87 Difference]: Start difference. First operand 300 states and 384 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 10:11:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:58,411 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-28 10:11:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:11:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 37 [2022-04-28 10:11:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 10:11:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 10:11:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 10:11:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 10:11:58,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-28 10:11:58,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:58,459 INFO L225 Difference]: With dead ends: 317 [2022-04-28 10:11:58,459 INFO L226 Difference]: Without dead ends: 288 [2022-04-28 10:11:58,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:11:58,459 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:58,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:11:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-28 10:11:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-04-28 10:11:59,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:59,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 10:11:59,735 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 10:11:59,735 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 10:11:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:59,739 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2022-04-28 10:11:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 370 transitions. [2022-04-28 10:11:59,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:59,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:59,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 288 states. [2022-04-28 10:11:59,739 INFO L87 Difference]: Start difference. First operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 288 states. [2022-04-28 10:11:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:59,742 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2022-04-28 10:11:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 370 transitions. [2022-04-28 10:11:59,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:59,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:59,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:59,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 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 10:11:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 366 transitions. [2022-04-28 10:11:59,747 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 366 transitions. Word has length 37 [2022-04-28 10:11:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:59,747 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 366 transitions. [2022-04-28 10:11:59,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 10:11:59,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 284 states and 366 transitions. [2022-04-28 10:12:01,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 366 transitions. [2022-04-28 10:12:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:01,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:01,527 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:01,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:01,728 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1702220111, now seen corresponding path program 25 times [2022-04-28 10:12:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:01,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30140002] [2022-04-28 10:12:01,731 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:01,731 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1702220111, now seen corresponding path program 26 times [2022-04-28 10:12:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:01,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802784112] [2022-04-28 10:12:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:01,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {67053#(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); {67033#true} is VALID [2022-04-28 10:12:01,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-28 10:12:01,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-28 10:12:01,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67053#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:01,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {67053#(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); {67033#true} is VALID [2022-04-28 10:12:01,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-28 10:12:01,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-28 10:12:01,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-28 10:12:01,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67038#(= main_~y~0 0)} is VALID [2022-04-28 10:12:01,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {67038#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:01,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {67039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:01,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {67040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:01,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {67041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:01,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {67042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:01,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {67043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:01,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {67044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:01,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:01,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {67046#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:01,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {67046#(and (<= main_~z~0 7) (<= 7 main_~z~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; {67047#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:01,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {67047#(and (<= main_~z~0 6) (<= 6 main_~z~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; {67048#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {67048#(and (<= main_~z~0 5) (<= 5 main_~z~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; {67049#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {67049#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {67050#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {67050#(and (<= main_~z~0 3) (<= 3 main_~z~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; {67051#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {67051#(and (<= main_~z~0 2) (<= 2 main_~z~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; {67052#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {67052#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {67034#false} 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; {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {67034#false} assume !(~y~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {67034#false} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-28 10:12:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802784112] [2022-04-28 10:12:01,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802784112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839802220] [2022-04-28 10:12:01,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:01,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:01,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:01,973 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:01,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 10:12:02,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:02,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:02,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:12:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:02,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:02,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67033#true} is VALID [2022-04-28 10:12:02,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#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); {67033#true} is VALID [2022-04-28 10:12:02,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-28 10:12:02,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-28 10:12:02,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-28 10:12:02,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67033#true} is VALID [2022-04-28 10:12:02,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67033#true} is VALID [2022-04-28 10:12:02,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:02,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:02,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:02,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:02,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:02,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 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; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:02,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {67094#(< 0 (mod (+ 5 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; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:02,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 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; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:02,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 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; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:02,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 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; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:02,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:02,266 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-28 10:12:02,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-28 10:12:02,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-28 10:12:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:02,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-28 10:12:02,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-28 10:12:02,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {67123#(< 0 (mod main_~x~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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 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; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:02,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 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; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:02,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 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; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:02,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 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; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:02,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {67094#(< 0 (mod (+ 5 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; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:02,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 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; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:02,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:02,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:02,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:02,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:02,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:02,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#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); {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67033#true} is VALID [2022-04-28 10:12:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839802220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:02,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:12:02,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:02,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30140002] [2022-04-28 10:12:02,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30140002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:02,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:02,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:12:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561677568] [2022-04-28 10:12:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:02,397 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 37 [2022-04-28 10:12:02,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:02,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:12:02,416 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 10:12:02,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:12:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:12:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:12:02,416 INFO L87 Difference]: Start difference. First operand 284 states and 366 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:12:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,131 INFO L93 Difference]: Finished difference Result 413 states and 525 transitions. [2022-04-28 10:12:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:12:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 37 [2022-04-28 10:12:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:12:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-28 10:12:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:12:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-28 10:12:07,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 118 transitions. [2022-04-28 10:12:07,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:07,224 INFO L225 Difference]: With dead ends: 413 [2022-04-28 10:12:07,224 INFO L226 Difference]: Without dead ends: 370 [2022-04-28 10:12:07,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=2327, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:12:07,225 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:07,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 113 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-04-28 10:12:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 285. [2022-04-28 10:12:08,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:08,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 10:12:08,470 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 10:12:08,470 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 10:12:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:08,474 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-04-28 10:12:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 477 transitions. [2022-04-28 10:12:08,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:08,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:08,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 370 states. [2022-04-28 10:12:08,475 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 370 states. [2022-04-28 10:12:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:08,479 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-04-28 10:12:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 477 transitions. [2022-04-28 10:12:08,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:08,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:08,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:08,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 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 10:12:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2022-04-28 10:12:08,484 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 37 [2022-04-28 10:12:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:08,484 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2022-04-28 10:12:08,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:12:08,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 365 transitions. [2022-04-28 10:12:10,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2022-04-28 10:12:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:10,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:10,113 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:10,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:10,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 10:12:10,313 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -612758369, now seen corresponding path program 51 times [2022-04-28 10:12:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:10,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185357195] [2022-04-28 10:12:10,316 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:10,316 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -612758369, now seen corresponding path program 52 times [2022-04-28 10:12:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641341631] [2022-04-28 10:12:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {69496#(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); {69470#true} is VALID [2022-04-28 10:12:10,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-28 10:12:10,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-28 10:12:10,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:10,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {69496#(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); {69470#true} is VALID [2022-04-28 10:12:10,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-28 10:12:10,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-28 10:12:10,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-28 10:12:10,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69475#(= main_~y~0 0)} is VALID [2022-04-28 10:12:10,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {69475#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:10,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:10,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:10,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:10,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:10,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:10,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:10,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:10,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:10,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:10,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:10,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:10,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:10,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:10,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:10,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:10,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:10,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:10,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:10,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} 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; {69495#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {69495#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} 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; {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:10,657 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-28 10:12:10,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-28 10:12:10,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-28 10:12:10,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-28 10:12:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:12:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641341631] [2022-04-28 10:12:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641341631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095892131] [2022-04-28 10:12:10,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:10,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:10,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:10,659 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:10,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 10:12:10,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:10,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:10,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:12:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:11,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69470#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#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); {69470#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-28 10:12:11,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-28 10:12:11,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69475#(= main_~y~0 0)} is VALID [2022-04-28 10:12:11,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {69475#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:11,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:11,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:11,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:11,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:11,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:11,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:11,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:11,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:11,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:11,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:11,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:11,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:11,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:11,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:11,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:11,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:11,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:11,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:11,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:12:11,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} 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; {69578#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:12:11,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {69578#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} 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; {69471#false} is VALID [2022-04-28 10:12:11,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-28 10:12:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:12:11,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} 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; {69471#false} is VALID [2022-04-28 10:12:11,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {69636#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-28 10:12:11,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {69640#(< 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; {69636#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:11,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {69640#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:11,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:11,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {69651#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:11,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {69655#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69651#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:11,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {69659#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69655#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:11,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {69663#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69659#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:11,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {69667#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69663#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:11,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {69671#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69667#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:11,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {69675#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69671#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:11,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {69679#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69675#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:11,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {69683#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69679#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:11,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {69687#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69683#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:11,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {69691#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69687#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:11,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {69695#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69691#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:11,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {69699#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69695#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:11,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {69703#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69699#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:11,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {69707#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69703#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:11,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {69711#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69707#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:11,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {69715#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69711#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:11,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {69719#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69715#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:11,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69719#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:11,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-28 10:12:11,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-28 10:12:11,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-28 10:12:11,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#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); {69470#true} is VALID [2022-04-28 10:12:11,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69470#true} is VALID [2022-04-28 10:12:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:12:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095892131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:11,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:12:11,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:11,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185357195] [2022-04-28 10:12:11,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185357195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:11,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:11,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:12:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137124419] [2022-04-28 10:12:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 37 [2022-04-28 10:12:11,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:11,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 10:12:11,782 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 10:12:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:12:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:12:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:11,782 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 10:12:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:23,384 INFO L93 Difference]: Finished difference Result 641 states and 897 transitions. [2022-04-28 10:12:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:12:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 37 [2022-04-28 10:12:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 10:12:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 242 transitions. [2022-04-28 10:12:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 10:12:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 242 transitions. [2022-04-28 10:12:23,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 242 transitions. [2022-04-28 10:12:23,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:23,582 INFO L225 Difference]: With dead ends: 641 [2022-04-28 10:12:23,582 INFO L226 Difference]: Without dead ends: 615 [2022-04-28 10:12:23,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:12:23,583 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4018 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:23,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 215 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4018 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 10:12:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-28 10:12:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 299. [2022-04-28 10:12:24,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:24,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 10:12:24,908 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 10:12:24,908 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 10:12:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,919 INFO L93 Difference]: Finished difference Result 615 states and 772 transitions. [2022-04-28 10:12:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 772 transitions. [2022-04-28 10:12:24,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:24,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:24,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 615 states. [2022-04-28 10:12:24,920 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 615 states. [2022-04-28 10:12:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,931 INFO L93 Difference]: Finished difference Result 615 states and 772 transitions. [2022-04-28 10:12:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 772 transitions. [2022-04-28 10:12:24,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:24,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:24,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:24,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 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 10:12:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 385 transitions. [2022-04-28 10:12:24,936 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 385 transitions. Word has length 37 [2022-04-28 10:12:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:24,936 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 385 transitions. [2022-04-28 10:12:24,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 10:12:24,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 385 transitions. [2022-04-28 10:12:26,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-28 10:12:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:26,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:26,696 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:26,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 10:12:26,897 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2053708003, now seen corresponding path program 27 times [2022-04-28 10:12:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447030919] [2022-04-28 10:12:26,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:26,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2053708003, now seen corresponding path program 28 times [2022-04-28 10:12:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:26,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067669437] [2022-04-28 10:12:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {72916#(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); {72894#true} is VALID [2022-04-28 10:12:27,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-28 10:12:27,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-28 10:12:27,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:27,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {72916#(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); {72894#true} is VALID [2022-04-28 10:12:27,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-28 10:12:27,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-28 10:12:27,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-28 10:12:27,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72899#(= main_~y~0 0)} is VALID [2022-04-28 10:12:27,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {72899#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:27,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {72900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:27,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {72901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:27,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {72902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:27,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {72903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:27,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {72904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:27,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {72905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:27,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:27,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:27,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~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; {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:27,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {72908#(and (<= main_~z~0 6) (<= 6 main_~z~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; {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:27,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {72909#(and (<= main_~z~0 5) (<= 5 main_~z~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; {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:27,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:27,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {72911#(and (<= main_~z~0 3) (<= 3 main_~z~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; {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:27,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {72912#(and (<= main_~z~0 2) (<= 2 main_~z~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; {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:27,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {72913#(and (<= main_~z~0 1) (<= 1 main_~z~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; {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:12:27,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:12:27,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {72914#(and (<= main_~z~0 0) (<= 0 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; {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:27,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {72913#(and (<= main_~z~0 1) (<= 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; {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:27,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {72912#(and (<= main_~z~0 2) (<= 2 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; {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:27,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {72911#(and (<= main_~z~0 3) (<= 3 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; {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:27,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {72910#(and (<= 4 main_~z~0) (<= main_~z~0 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; {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:27,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {72909#(and (<= main_~z~0 5) (<= 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; {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:27,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {72908#(and (<= main_~z~0 6) (<= 6 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; {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:27,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:27,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:27,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72915#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:27,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {72915#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-28 10:12:27,203 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-28 10:12:27,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-28 10:12:27,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-28 10:12:27,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-28 10:12:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:27,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067669437] [2022-04-28 10:12:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067669437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965006098] [2022-04-28 10:12:27,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:27,205 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:27,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 10:12:27,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:27,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:27,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:12:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:27,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72894#true} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#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); {72894#true} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-28 10:12:27,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-28 10:12:27,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72894#true} is VALID [2022-04-28 10:12:27,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {72894#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:27,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:27,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:27,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:27,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:27,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {72962#(< 0 (mod (+ 7 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; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:27,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 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; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {72954#(< 0 (mod (+ 5 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; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:27,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 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; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:27,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 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; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:27,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 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; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:27,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {72895#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {72895#false} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-28 10:12:27,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-28 10:12:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:27,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:27,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-28 10:12:27,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-28 10:12:27,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-28 10:12:27,663 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-28 10:12:27,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {72895#false} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-28 10:12:27,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {72895#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72895#false} is VALID [2022-04-28 10:12:27,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-28 10:12:27,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {72990#(< 0 (mod main_~x~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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 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; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:27,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 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; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:27,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 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; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:27,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 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; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:27,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {72954#(< 0 (mod (+ 5 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; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:27,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 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; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {72962#(< 0 (mod (+ 7 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; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:27,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:27,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:27,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:27,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:27,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:27,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {72894#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:27,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72894#true} is VALID [2022-04-28 10:12:27,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-28 10:12:27,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-28 10:12:27,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-28 10:12:27,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#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); {72894#true} is VALID [2022-04-28 10:12:27,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72894#true} is VALID [2022-04-28 10:12:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:27,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965006098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:27,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:12:27,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:27,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447030919] [2022-04-28 10:12:27,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447030919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:27,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:12:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358068432] [2022-04-28 10:12:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 38 [2022-04-28 10:12:27,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:27,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 10:12:27,707 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 10:12:27,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:12:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:12:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:12:27,707 INFO L87 Difference]: Start difference. First operand 299 states and 385 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 10:12:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:36,554 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2022-04-28 10:12:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-28 10:12:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 38 [2022-04-28 10:12:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 10:12:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 243 transitions. [2022-04-28 10:12:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 10:12:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 243 transitions. [2022-04-28 10:12:36,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 243 transitions. [2022-04-28 10:12:36,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:36,772 INFO L225 Difference]: With dead ends: 434 [2022-04-28 10:12:36,772 INFO L226 Difference]: Without dead ends: 416 [2022-04-28 10:12:36,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=571, Invalid=10559, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 10:12:36,773 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:36,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 124 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:12:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-04-28 10:12:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 309. [2022-04-28 10:12:38,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:38,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 10:12:38,146 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 10:12:38,146 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 10:12:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:38,152 INFO L93 Difference]: Finished difference Result 416 states and 521 transitions. [2022-04-28 10:12:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 521 transitions. [2022-04-28 10:12:38,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:38,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:38,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 416 states. [2022-04-28 10:12:38,153 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 416 states. [2022-04-28 10:12:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:38,159 INFO L93 Difference]: Finished difference Result 416 states and 521 transitions. [2022-04-28 10:12:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 521 transitions. [2022-04-28 10:12:38,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:38,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:38,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:38,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 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 10:12:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 395 transitions. [2022-04-28 10:12:38,164 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 395 transitions. Word has length 38 [2022-04-28 10:12:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:38,164 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 395 transitions. [2022-04-28 10:12:38,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 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 10:12:38,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 395 transitions. [2022-04-28 10:12:39,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 395 transitions. [2022-04-28 10:12:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:39,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:39,922 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:39,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-28 10:12:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 10:12:40,123 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 53 times [2022-04-28 10:12:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304356018] [2022-04-28 10:12:40,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:40,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 54 times [2022-04-28 10:12:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:40,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053477277] [2022-04-28 10:12:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:40,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {75644#(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); {75626#true} is VALID [2022-04-28 10:12:40,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-28 10:12:40,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-28 10:12:40,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:40,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {75644#(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); {75626#true} is VALID [2022-04-28 10:12:40,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-28 10:12:40,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-28 10:12:40,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-28 10:12:40,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75631#(= main_~y~0 0)} is VALID [2022-04-28 10:12:40,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {75631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:40,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:40,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:40,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:40,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:40,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:40,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:40,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:40,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:40,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:40,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:40,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {75641#(and (<= main_~z~0 7) (<= 7 main_~z~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; {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:40,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {75642#(and (<= main_~z~0 6) (<= 6 main_~z~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; {75643#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {75643#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-28 10:12:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:40,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053477277] [2022-04-28 10:12:40,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053477277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:40,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877172623] [2022-04-28 10:12:40,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:40,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:40,330 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:40,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 10:12:40,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:12:40,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:40,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:12:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:40,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:40,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75626#true} is VALID [2022-04-28 10:12:40,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#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); {75626#true} is VALID [2022-04-28 10:12:40,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-28 10:12:40,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-28 10:12:40,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-28 10:12:40,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75631#(= main_~y~0 0)} is VALID [2022-04-28 10:12:40,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {75631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:40,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:40,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:40,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:40,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:40,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:40,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:40,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:40,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:40,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:40,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:40,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {75641#(and (<= main_~z~0 7) (<= 7 main_~z~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; {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:40,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {75642#(and (<= main_~z~0 6) (<= 6 main_~z~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; {75702#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-28 10:12:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:40,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:40,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} 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; {75627#false} is VALID [2022-04-28 10:12:40,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {75814#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-28 10:12:41,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {75818#(< 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; {75814#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:41,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {75822#(< 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; {75818#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:41,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {75826#(< 0 (mod (+ main_~z~0 4294967293) 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; {75822#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:41,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {75826#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:41,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:41,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {75837#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:41,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {75841#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75837#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:41,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {75845#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75841#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:41,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {75849#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75845#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:41,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {75853#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75849#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:41,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {75857#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75853#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:41,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {75861#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75857#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:41,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {75865#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75861#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:41,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75865#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:41,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-28 10:12:41,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-28 10:12:41,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-28 10:12:41,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#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); {75626#true} is VALID [2022-04-28 10:12:41,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75626#true} is VALID [2022-04-28 10:12:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:41,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877172623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:41,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:41,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:12:41,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:41,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304356018] [2022-04-28 10:12:41,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304356018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:41,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:41,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934853595] [2022-04-28 10:12:41,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 38 [2022-04-28 10:12:41,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:41,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:41,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:41,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:12:41,037 INFO L87 Difference]: Start difference. First operand 309 states and 395 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:46,568 INFO L93 Difference]: Finished difference Result 472 states and 598 transitions. [2022-04-28 10:12:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:12:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 38 [2022-04-28 10:12:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-28 10:12:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-28 10:12:46,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 121 transitions. [2022-04-28 10:12:46,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:46,669 INFO L225 Difference]: With dead ends: 472 [2022-04-28 10:12:46,669 INFO L226 Difference]: Without dead ends: 453 [2022-04-28 10:12:46,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:12:46,670 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:46,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 108 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:12:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-28 10:12:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 309. [2022-04-28 10:12:48,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:48,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 10:12:48,034 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 10:12:48,034 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 10:12:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:48,041 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2022-04-28 10:12:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2022-04-28 10:12:48,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:48,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:48,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 453 states. [2022-04-28 10:12:48,042 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 453 states. [2022-04-28 10:12:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:48,049 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2022-04-28 10:12:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2022-04-28 10:12:48,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:48,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:48,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:48,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 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 10:12:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 394 transitions. [2022-04-28 10:12:48,057 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 394 transitions. Word has length 38 [2022-04-28 10:12:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:48,057 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 394 transitions. [2022-04-28 10:12:48,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:48,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 394 transitions. [2022-04-28 10:12:49,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 394 transitions. [2022-04-28 10:12:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:49,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:49,901 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:49,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:50,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-28 10:12:50,102 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 55 times [2022-04-28 10:12:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:50,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376948591] [2022-04-28 10:12:50,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:50,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 56 times [2022-04-28 10:12:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:50,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400556188] [2022-04-28 10:12:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {78410#(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); {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:50,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {78410#(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); {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-28 10:12:50,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-28 10:12:50,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78397#(= main_~y~0 0)} is VALID [2022-04-28 10:12:50,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {78397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:50,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:50,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:50,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:50,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:50,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:50,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:50,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:50,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:50,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:50,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:50,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:50,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {78409#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {78409#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {78393#false} 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; {78393#false} is VALID [2022-04-28 10:12:50,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {78393#false} assume !(~y~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {78393#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {78393#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {78393#false} assume !(~x~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {78393#false} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-28 10:12:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:12:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400556188] [2022-04-28 10:12:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400556188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860979700] [2022-04-28 10:12:50,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:50,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:50,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:50,317 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:50,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 10:12:50,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:50,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:50,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:50,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:50,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78392#true} is VALID [2022-04-28 10:12:50,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#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); {78392#true} is VALID [2022-04-28 10:12:50,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-28 10:12:50,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-28 10:12:50,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-28 10:12:50,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78397#(= main_~y~0 0)} is VALID [2022-04-28 10:12:50,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {78397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:50,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:50,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:50,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:50,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:50,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:50,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:50,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:50,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:50,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:50,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:50,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:50,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:50,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:50,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {78468#(and (<= main_~z~0 7) (<= 7 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; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:50,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:50,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {78481#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:50,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {78481#(and (<= main_~z~0 10) (<= 10 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; {78485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:50,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {78485#(and (<= main_~z~0 11) (<= 11 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; {78489#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:50,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {78489#(and (<= main_~z~0 12) (<= 12 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; {78493#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:50,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {78493#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {78497#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:50,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {78497#(and (<= 14 main_~z~0) (<= main_~z~0 14))} 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; {78501#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:50,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {78501#(and (<= main_~z~0 15) (<= 15 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; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:50,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:50,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:50,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:50,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:50,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:50,803 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-28 10:12:50,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-28 10:12:50,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-28 10:12:50,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-28 10:12:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:12:50,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:51,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-28 10:12:51,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-28 10:12:51,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-28 10:12:51,386 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-28 10:12:51,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-28 10:12:51,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:51,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:51,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:51,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:51,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {78561#(< 0 (mod (+ main_~z~0 1) 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; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:51,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {78565#(< 0 (mod (+ main_~z~0 2) 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; {78561#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:12:51,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {78569#(< 0 (mod (+ main_~z~0 3) 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; {78565#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:12:51,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {78573#(< 0 (mod (+ main_~z~0 4) 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; {78569#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:12:51,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {78577#(< 0 (mod (+ 5 main_~z~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; {78573#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:12:51,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#(< 0 (mod (+ main_~z~0 6) 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; {78577#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:51,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {78585#(< 0 (mod (+ 7 main_~z~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; {78581#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:12:51,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {78589#(< 0 (mod (+ main_~z~0 8) 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; {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:51,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {78593#(< 0 (mod (+ main_~z~0 9) 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; {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:12:51,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:12:51,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {78589#(< 0 (mod (+ main_~z~0 8) 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; {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:12:51,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {78585#(< 0 (mod (+ 7 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; {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:12:51,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} ~z~0 := ~y~0; {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:51,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:51,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {78613#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:51,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {78617#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78613#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:51,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {78621#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78617#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:51,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {78625#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78621#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:51,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {78629#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78625#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:51,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {78633#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78629#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:51,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {78637#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78633#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:51,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {78641#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78637#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:51,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {78645#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78641#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:51,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78645#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:51,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-28 10:12:51,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-28 10:12:51,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-28 10:12:51,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#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); {78392#true} is VALID [2022-04-28 10:12:51,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78392#true} is VALID [2022-04-28 10:12:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:12:51,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860979700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:51,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:51,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 44 [2022-04-28 10:12:51,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:51,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376948591] [2022-04-28 10:12:51,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376948591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:51,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:51,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659727735] [2022-04-28 10:12:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 38 [2022-04-28 10:12:51,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:51,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:51,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:12:51,420 INFO L87 Difference]: Start difference. First operand 309 states and 394 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:57,346 INFO L93 Difference]: Finished difference Result 503 states and 633 transitions. [2022-04-28 10:12:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:12:57,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 38 [2022-04-28 10:12:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 10:12:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 10:12:57,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 128 transitions. [2022-04-28 10:12:57,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:57,457 INFO L225 Difference]: With dead ends: 503 [2022-04-28 10:12:57,457 INFO L226 Difference]: Without dead ends: 484 [2022-04-28 10:12:57,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=2969, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:12:57,458 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:57,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 110 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:12:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-04-28 10:12:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2022-04-28 10:12:58,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:58,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 10:12:58,859 INFO L74 IsIncluded]: Start isIncluded. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 10:12:58,859 INFO L87 Difference]: Start difference. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 10:12:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,866 INFO L93 Difference]: Finished difference Result 484 states and 613 transitions. [2022-04-28 10:12:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 613 transitions. [2022-04-28 10:12:58,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:58,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:58,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 484 states. [2022-04-28 10:12:58,867 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 484 states. [2022-04-28 10:12:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,875 INFO L93 Difference]: Finished difference Result 484 states and 613 transitions. [2022-04-28 10:12:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 613 transitions. [2022-04-28 10:12:58,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:58,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:58,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:58,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 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 10:12:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 393 transitions. [2022-04-28 10:12:58,880 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 393 transitions. Word has length 38 [2022-04-28 10:12:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:58,880 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 393 transitions. [2022-04-28 10:12:58,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 10:12:58,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 393 transitions. [2022-04-28 10:13:00,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 393 transitions. [2022-04-28 10:13:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:13:00,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:00,668 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:00,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:00,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-28 10:13:00,869 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:00,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1963340210, now seen corresponding path program 57 times [2022-04-28 10:13:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:00,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487340543] [2022-04-28 10:13:00,871 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:00,871 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1963340210, now seen corresponding path program 58 times [2022-04-28 10:13:00,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:00,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128439117] [2022-04-28 10:13:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:01,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {81317#(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); {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:01,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {81317#(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); {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-28 10:13:01,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-28 10:13:01,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81295#(= main_~y~0 0)} is VALID [2022-04-28 10:13:01,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {81295#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:01,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:01,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:01,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:01,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:01,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:01,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:01,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:01,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:01,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:01,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:01,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:01,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:01,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:01,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:01,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:01,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:01,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:01,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:01,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:01,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:13:01,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} 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; {81316#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} 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; {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-28 10:13:01,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-28 10:13:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:13:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:01,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128439117] [2022-04-28 10:13:01,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128439117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:01,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81382203] [2022-04-28 10:13:01,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:01,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:01,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:01,234 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:01,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 10:13:01,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:01,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:01,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:01,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:01,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81290#true} is VALID [2022-04-28 10:13:01,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#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); {81290#true} is VALID [2022-04-28 10:13:01,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-28 10:13:01,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-28 10:13:01,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-28 10:13:01,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81295#(= main_~y~0 0)} is VALID [2022-04-28 10:13:01,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {81295#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:01,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:01,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:01,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:01,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:01,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:01,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:01,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:01,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:01,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:01,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:01,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:01,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:01,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:01,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:01,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:01,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:01,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:01,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:01,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:01,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:13:01,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} 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; {81402#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {81402#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} 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; {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-28 10:13:01,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-28 10:13:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:13:01,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:02,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} 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; {81291#false} is VALID [2022-04-28 10:13:02,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {81460#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-28 10:13:02,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {81464#(< 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; {81460#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:02,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {81464#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:02,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:02,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {81475#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:02,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {81479#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:02,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {81483#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81479#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:02,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {81487#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81483#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:02,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {81491#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81487#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:02,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {81495#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81491#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:02,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {81499#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81495#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:02,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {81503#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81499#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:02,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {81507#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81503#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:02,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {81511#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81507#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:02,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {81515#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81511#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:02,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {81519#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81515#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:02,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {81523#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81519#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:02,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {81527#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81523#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:02,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {81531#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81527#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:02,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {81535#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81531#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:02,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {81539#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81535#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:02,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {81543#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81539#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:02,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {81547#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81543#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:02,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81547#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:13:02,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-28 10:13:02,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-28 10:13:02,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-28 10:13:02,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#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); {81290#true} is VALID [2022-04-28 10:13:02,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81290#true} is VALID [2022-04-28 10:13:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:13:02,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81382203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:02,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:02,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:02,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487340543] [2022-04-28 10:13:02,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487340543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:02,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:02,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020180860] [2022-04-28 10:13:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 38 [2022-04-28 10:13:02,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:02,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 10:13:02,376 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 10:13:02,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:02,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:02,377 INFO L87 Difference]: Start difference. First operand 309 states and 393 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 10:13:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:15,917 INFO L93 Difference]: Finished difference Result 722 states and 1011 transitions. [2022-04-28 10:13:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:13:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 38 [2022-04-28 10:13:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 10:13:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 254 transitions. [2022-04-28 10:13:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 10:13:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 254 transitions. [2022-04-28 10:13:15,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 254 transitions. [2022-04-28 10:13:16,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:16,129 INFO L225 Difference]: With dead ends: 722 [2022-04-28 10:13:16,129 INFO L226 Difference]: Without dead ends: 696 [2022-04-28 10:13:16,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1063, Invalid=3907, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:13:16,129 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 184 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:16,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 221 Invalid, 4381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 10:13:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-04-28 10:13:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 323. [2022-04-28 10:13:17,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:17,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 10:13:17,543 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 10:13:17,543 INFO L87 Difference]: Start difference. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 10:13:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:17,557 INFO L93 Difference]: Finished difference Result 696 states and 881 transitions. [2022-04-28 10:13:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 881 transitions. [2022-04-28 10:13:17,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:17,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:17,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 696 states. [2022-04-28 10:13:17,558 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 696 states. [2022-04-28 10:13:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:17,571 INFO L93 Difference]: Finished difference Result 696 states and 881 transitions. [2022-04-28 10:13:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 881 transitions. [2022-04-28 10:13:17,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:17,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:17,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:17,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 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 10:13:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 413 transitions. [2022-04-28 10:13:17,577 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 413 transitions. Word has length 38 [2022-04-28 10:13:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:17,577 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 413 transitions. [2022-04-28 10:13:17,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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 10:13:17,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 413 transitions. [2022-04-28 10:13:19,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 413 transitions. [2022-04-28 10:13:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:19,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:19,709 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:19,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:19,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 10:13:19,910 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -445243775, now seen corresponding path program 29 times [2022-04-28 10:13:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695361237] [2022-04-28 10:13:19,912 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:19,912 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -445243775, now seen corresponding path program 30 times [2022-04-28 10:13:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130533946] [2022-04-28 10:13:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:20,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {85117#(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); {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:20,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {85117#(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); {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-28 10:13:20,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-28 10:13:20,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85101#(= main_~y~0 0)} is VALID [2022-04-28 10:13:20,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {85101#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:20,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {85102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:20,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {85103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:20,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {85104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:20,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {85105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:20,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {85106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:20,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {85107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:20,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {85108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:20,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:20,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {85110#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:20,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {85110#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {85111#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:20,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {85111#(and (<= main_~z~0 7) (<= 7 main_~z~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; {85112#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:20,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {85112#(and (<= main_~z~0 6) (<= 6 main_~z~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; {85113#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:20,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {85113#(and (<= main_~z~0 5) (<= 5 main_~z~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; {85114#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:20,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {85114#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {85115#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:20,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {85115#(and (<= main_~z~0 3) (<= 3 main_~z~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; {85116#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:20,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {85116#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {85097#false} 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; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {85097#false} assume !(~y~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {85097#false} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-28 10:13:20,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-28 10:13:20,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-28 10:13:20,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-28 10:13:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:13:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130533946] [2022-04-28 10:13:20,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130533946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394161290] [2022-04-28 10:13:20,147 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:20,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:20,148 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 10:13:20,280 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:13:20,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:20,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:13:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:20,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:20,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85096#true} is VALID [2022-04-28 10:13:20,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#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); {85096#true} is VALID [2022-04-28 10:13:20,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-28 10:13:20,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-28 10:13:20,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-28 10:13:20,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85096#true} is VALID [2022-04-28 10:13:20,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-28 10:13:20,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-28 10:13:20,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:20,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:20,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:20,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:20,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:20,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 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; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:20,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {85161#(< 0 (mod (+ 5 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; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:20,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 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; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:20,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 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; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:20,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 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; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:20,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-28 10:13:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:13:20,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:20,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-28 10:13:20,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-28 10:13:20,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {85190#(< 0 (mod main_~x~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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 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; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:20,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 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; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:20,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 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; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:20,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 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; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:20,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {85161#(< 0 (mod (+ 5 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; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:20,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 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; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:20,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:20,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:20,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:20,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:20,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#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); {85096#true} is VALID [2022-04-28 10:13:20,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85096#true} is VALID [2022-04-28 10:13:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:13:20,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394161290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:20,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:20,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-28 10:13:20,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:20,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695361237] [2022-04-28 10:13:20,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695361237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:20,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:20,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:13:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643851090] [2022-04-28 10:13:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-28 10:13:20,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:20,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:13:20,699 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 10:13:20,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:13:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:20,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:13:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:13:20,700 INFO L87 Difference]: Start difference. First operand 323 states and 413 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:13:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:27,095 INFO L93 Difference]: Finished difference Result 486 states and 619 transitions. [2022-04-28 10:13:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:13:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-28 10:13:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:13:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-28 10:13:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:13:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-28 10:13:27,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 135 transitions. [2022-04-28 10:13:27,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:27,213 INFO L225 Difference]: With dead ends: 486 [2022-04-28 10:13:27,213 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 10:13:27,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=2933, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:13:27,213 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:27,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 128 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:13:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 10:13:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 324. [2022-04-28 10:13:28,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:28,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 10:13:28,643 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 10:13:28,643 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 10:13:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:28,650 INFO L93 Difference]: Finished difference Result 440 states and 568 transitions. [2022-04-28 10:13:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 568 transitions. [2022-04-28 10:13:28,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:28,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:28,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 440 states. [2022-04-28 10:13:28,651 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 440 states. [2022-04-28 10:13:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:28,657 INFO L93 Difference]: Finished difference Result 440 states and 568 transitions. [2022-04-28 10:13:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 568 transitions. [2022-04-28 10:13:28,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:28,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:28,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:28,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 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 10:13:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 412 transitions. [2022-04-28 10:13:28,662 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 412 transitions. Word has length 39 [2022-04-28 10:13:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:28,662 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 412 transitions. [2022-04-28 10:13:28,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:13:28,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 412 transitions. [2022-04-28 10:13:30,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-28 10:13:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:30,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:30,670 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:30,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:30,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:30,870 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 218017535, now seen corresponding path program 59 times [2022-04-28 10:13:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:30,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247183434] [2022-04-28 10:13:30,873 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:30,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 218017535, now seen corresponding path program 60 times [2022-04-28 10:13:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:30,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475895184] [2022-04-28 10:13:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:31,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {87948#(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); {87920#true} is VALID [2022-04-28 10:13:31,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-28 10:13:31,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-28 10:13:31,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:31,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {87948#(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); {87920#true} is VALID [2022-04-28 10:13:31,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-28 10:13:31,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-28 10:13:31,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-28 10:13:31,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87925#(= main_~y~0 0)} is VALID [2022-04-28 10:13:31,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {87925#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:31,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {87926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:31,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {87927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:31,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {87928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:31,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {87929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:31,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {87930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:31,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {87931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:31,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {87932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87933#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:31,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {87933#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87934#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:31,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {87934#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87935#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:31,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {87935#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87936#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:31,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {87936#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87937#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:31,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {87937#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87938#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:31,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {87938#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87939#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:31,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {87939#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87940#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:31,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {87940#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87941#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:31,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {87941#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87942#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:31,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {87942#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87943#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:31,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {87943#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87944#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:31,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {87944#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:31,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:31,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {87946#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:13:31,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {87946#(and (<= main_~z~0 20) (<= 20 main_~z~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; {87947#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {87947#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {87921#false} 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; {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {87921#false} assume !(~y~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {87921#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {87921#false} assume !(~x~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {87921#false} assume !(~z~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L272 TraceCheckUtils]: 35: Hoare triple {87921#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {87921#false} ~cond := #in~cond; {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {87921#false} assume 0 == ~cond; {87921#false} is VALID [2022-04-28 10:13:31,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-28 10:13:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:13:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:31,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475895184] [2022-04-28 10:13:31,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475895184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:31,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666346042] [2022-04-28 10:13:31,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:31,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:31,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:31,273 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:31,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 10:13:31,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:13:31,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:31,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:13:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:31,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:31,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#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); {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {87920#true} assume !(~x~0 % 4294967296 > 0); {87920#true} is VALID [2022-04-28 10:13:31,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {87920#true} ~z~0 := ~y~0; {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:31,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {88033#(= 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; {88037#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:13:31,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {88037#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {88037#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:13:31,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {88037#(= 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; {88044#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:13:31,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {88044#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {88044#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:13:31,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {88044#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:31,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {88033#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:31,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {88033#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {88057#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:31,583 INFO L272 TraceCheckUtils]: 35: Hoare triple {88057#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:31,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {88065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:31,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {88065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {87921#false} is VALID [2022-04-28 10:13:31,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-28 10:13:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 10:13:31,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:31,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-28 10:13:31,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {88065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {87921#false} is VALID [2022-04-28 10:13:31,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {88065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:31,839 INFO L272 TraceCheckUtils]: 35: Hoare triple {88057#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:31,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {88057#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:31,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:31,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:31,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:13:31,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:13:31,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {87920#true} ~z~0 := ~y~0; {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {87920#true} assume !(~x~0 % 4294967296 > 0); {87920#true} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#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); {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87920#true} is VALID [2022-04-28 10:13:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 10:13:31,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666346042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:31,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:31,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 8] total 35 [2022-04-28 10:13:31,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:31,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247183434] [2022-04-28 10:13:31,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247183434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:31,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:31,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:13:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292412873] [2022-04-28 10:13:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 39 [2022-04-28 10:13:31,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:31,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 10:13:31,869 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 10:13:31,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:13:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:31,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:13:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:13:31,869 INFO L87 Difference]: Start difference. First operand 324 states and 412 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 10:13:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:46,906 INFO L93 Difference]: Finished difference Result 756 states and 1059 transitions. [2022-04-28 10:13:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:13:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 39 [2022-04-28 10:13:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 10:13:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 266 transitions. [2022-04-28 10:13:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 10:13:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 266 transitions. [2022-04-28 10:13:46,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 266 transitions. [2022-04-28 10:13:47,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:47,142 INFO L225 Difference]: With dead ends: 756 [2022-04-28 10:13:47,142 INFO L226 Difference]: Without dead ends: 730 [2022-04-28 10:13:47,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=3226, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:13:47,143 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 195 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4904 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 4904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:47,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 237 Invalid, 5045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 4904 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 10:13:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-04-28 10:13:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 338. [2022-04-28 10:13:48,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:48,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 10:13:48,622 INFO L74 IsIncluded]: Start isIncluded. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 10:13:48,622 INFO L87 Difference]: Start difference. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 10:13:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:48,637 INFO L93 Difference]: Finished difference Result 730 states and 924 transitions. [2022-04-28 10:13:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 924 transitions. [2022-04-28 10:13:48,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:48,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:48,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 730 states. [2022-04-28 10:13:48,638 INFO L87 Difference]: Start difference. First operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 730 states. [2022-04-28 10:13:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:48,652 INFO L93 Difference]: Finished difference Result 730 states and 924 transitions. [2022-04-28 10:13:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 924 transitions. [2022-04-28 10:13:48,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:48,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:48,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:48,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 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 10:13:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 432 transitions. [2022-04-28 10:13:48,658 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 432 transitions. Word has length 39 [2022-04-28 10:13:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:48,658 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 432 transitions. [2022-04-28 10:13:48,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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 10:13:48,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 338 states and 432 transitions. [2022-04-28 10:13:50,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 432 transitions. [2022-04-28 10:13:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:13:50,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:50,951 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:50,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-28 10:13:51,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:51,152 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 31 times [2022-04-28 10:13:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29657552] [2022-04-28 10:13:51,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:51,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 32 times [2022-04-28 10:13:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:51,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598371971] [2022-04-28 10:13:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:51,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:51,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {91904#(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); {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:51,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {91904#(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); {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-28 10:13:51,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-28 10:13:51,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-28 10:13:51,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91893#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:13:51,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {91893#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91894#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {91894#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91895#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {91895#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91896#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {91896#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:51,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:51,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:51,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 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; {91898#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:13:51,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {91898#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 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; {91899#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:13:51,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {91899#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) 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; {91900#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:13:51,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {91900#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) 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; {91901#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:13:51,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {91901#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) 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; {91902#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:51,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {91902#(<= (+ 5 (* (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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) 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; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-28 10:13:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:51,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:51,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598371971] [2022-04-28 10:13:51,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598371971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:51,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771615261] [2022-04-28 10:13:51,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:51,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:51,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:51,348 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:51,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 10:13:51,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:51,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:51,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:13:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:51,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:51,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91887#true} is VALID [2022-04-28 10:13:51,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#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); {91887#true} is VALID [2022-04-28 10:13:51,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-28 10:13:51,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-28 10:13:51,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-28 10:13:51,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-28 10:13:51,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:13:51,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:13:51,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:51,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:51,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:51,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} 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; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:13:51,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:13:51,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:51,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-28 10:13:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:51,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:52,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-28 10:13:52,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-28 10:13:52,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 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; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:52,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:13:52,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:13:52,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} 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; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:52,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:52,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:52,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:13:52,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:13:52,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:52,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-28 10:13:52,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-28 10:13:52,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-28 10:13:52,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-28 10:13:52,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#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); {91887#true} is VALID [2022-04-28 10:13:52,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91887#true} is VALID [2022-04-28 10:13:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771615261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:52,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:13:52,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:52,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29657552] [2022-04-28 10:13:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29657552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:52,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:13:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256462164] [2022-04-28 10:13:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 40 [2022-04-28 10:13:52,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:52,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 10:13:52,097 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 10:13:52,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:13:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:13:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:13:52,097 INFO L87 Difference]: Start difference. First operand 338 states and 432 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 10:13:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:55,164 INFO L93 Difference]: Finished difference Result 411 states and 542 transitions. [2022-04-28 10:13:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:13:55,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 40 [2022-04-28 10:13:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 10:13:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:13:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 10:13:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:13:55,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-28 10:13:55,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:55,281 INFO L225 Difference]: With dead ends: 411 [2022-04-28 10:13:55,281 INFO L226 Difference]: Without dead ends: 397 [2022-04-28 10:13:55,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:13:55,282 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 88 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:55,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 44 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:13:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-28 10:13:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2022-04-28 10:13:57,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:57,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 10:13:57,258 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 10:13:57,259 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 10:13:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:57,265 INFO L93 Difference]: Finished difference Result 397 states and 516 transitions. [2022-04-28 10:13:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 516 transitions. [2022-04-28 10:13:57,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:57,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:57,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 397 states. [2022-04-28 10:13:57,266 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 397 states. [2022-04-28 10:13:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:57,275 INFO L93 Difference]: Finished difference Result 397 states and 516 transitions. [2022-04-28 10:13:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 516 transitions. [2022-04-28 10:13:57,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:57,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:57,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:57,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 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 10:13:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2022-04-28 10:13:57,284 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 40 [2022-04-28 10:13:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:57,284 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2022-04-28 10:13:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 10:13:57,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 489 transitions. [2022-04-28 10:13:59,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2022-04-28 10:13:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:13:59,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:59,931 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:59,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:00,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:00,131 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1040873587, now seen corresponding path program 33 times [2022-04-28 10:14:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:00,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585865133] [2022-04-28 10:14:00,133 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:00,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1040873587, now seen corresponding path program 34 times [2022-04-28 10:14:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:00,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137071391] [2022-04-28 10:14:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:00,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {94574#(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); {94552#true} is VALID [2022-04-28 10:14:00,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-28 10:14:00,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-28 10:14:00,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:00,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {94574#(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); {94552#true} is VALID [2022-04-28 10:14:00,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-28 10:14:00,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-28 10:14:00,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-28 10:14:00,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94557#(= main_~y~0 0)} is VALID [2022-04-28 10:14:00,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {94557#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:00,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {94558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:00,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {94559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:00,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {94560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:00,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {94561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:00,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {94562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:00,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {94563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:00,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {94564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:00,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:00,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94566#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:00,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {94566#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {94567#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:00,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {94567#(and (<= main_~z~0 7) (<= 7 main_~z~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; {94568#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:00,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {94568#(and (<= main_~z~0 6) (<= 6 main_~z~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; {94569#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:00,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {94569#(and (<= main_~z~0 5) (<= 5 main_~z~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; {94570#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:00,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {94570#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {94571#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:00,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {94571#(and (<= main_~z~0 3) (<= 3 main_~z~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; {94572#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:00,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {94572#(and (<= main_~z~0 2) (<= 2 main_~z~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; {94573#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:14:00,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {94573#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {94553#false} 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; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {94553#false} assume !(~y~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {94553#false} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-28 10:14:00,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-28 10:14:00,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-28 10:14:00,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-28 10:14:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:14:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:00,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137071391] [2022-04-28 10:14:00,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137071391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:00,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350792829] [2022-04-28 10:14:00,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:00,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:00,446 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:00,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 10:14:00,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:00,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:00,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:14:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:00,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:00,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94552#true} is VALID [2022-04-28 10:14:00,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#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); {94552#true} is VALID [2022-04-28 10:14:00,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-28 10:14:00,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-28 10:14:00,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-28 10:14:00,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94552#true} is VALID [2022-04-28 10:14:00,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94552#true} is VALID [2022-04-28 10:14:00,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:00,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:00,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:00,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:00,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:00,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {94623#(< 0 (mod (+ 7 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; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:00,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 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; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {94615#(< 0 (mod (+ 5 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; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:00,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 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; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:00,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 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; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:00,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 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; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:00,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-28 10:14:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:00,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:00,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-28 10:14:00,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-28 10:14:00,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-28 10:14:00,945 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-28 10:14:00,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-28 10:14:00,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-28 10:14:00,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {94651#(< 0 (mod main_~x~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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 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; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:00,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 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; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:00,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 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; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:00,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 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; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:00,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {94615#(< 0 (mod (+ 5 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; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:00,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 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; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {94623#(< 0 (mod (+ 7 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; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:00,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:00,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:00,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:00,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:00,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:00,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:00,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#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); {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94552#true} is VALID [2022-04-28 10:14:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:00,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350792829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:00,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:00,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:14:00,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585865133] [2022-04-28 10:14:00,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585865133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:00,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:00,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:14:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941356775] [2022-04-28 10:14:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 40 [2022-04-28 10:14:00,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:00,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:14:00,981 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 10:14:00,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:14:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:14:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:14:00,982 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:14:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,586 INFO L93 Difference]: Finished difference Result 510 states and 655 transitions. [2022-04-28 10:14:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:14:07,586 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 40 [2022-04-28 10:14:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:14:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-28 10:14:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:14:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-28 10:14:07,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 134 transitions. [2022-04-28 10:14:07,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,698 INFO L225 Difference]: With dead ends: 510 [2022-04-28 10:14:07,698 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 10:14:07,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=3610, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:14:07,698 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:07,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 98 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:14:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 10:14:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 382. [2022-04-28 10:14:09,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:09,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 10:14:09,590 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 10:14:09,590 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 10:14:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:09,601 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-28 10:14:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-28 10:14:09,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:09,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:09,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 492 states. [2022-04-28 10:14:09,602 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 492 states. [2022-04-28 10:14:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:09,612 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-28 10:14:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-28 10:14:09,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:09,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:09,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:09,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 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 10:14:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2022-04-28 10:14:09,619 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 40 [2022-04-28 10:14:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:09,619 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2022-04-28 10:14:09,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 10:14:09,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 490 transitions. [2022-04-28 10:14:12,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2022-04-28 10:14:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:14:12,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:12,187 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:12,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-28 10:14:12,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-28 10:14:12,391 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 61 times [2022-04-28 10:14:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:12,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840029655] [2022-04-28 10:14:12,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:12,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 62 times [2022-04-28 10:14:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:12,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205490417] [2022-04-28 10:14:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {97679#(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); {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:12,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {97679#(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); {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-28 10:14:12,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-28 10:14:12,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97665#(= main_~y~0 0)} is VALID [2022-04-28 10:14:12,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {97665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:12,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:12,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:12,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:12,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:12,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:12,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:12,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:12,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:12,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:12,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:12,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:12,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:12,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 main_~z~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; {97678#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {97678#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {97661#false} 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; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {97661#false} assume !(~y~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-28 10:14:12,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {97661#false} assume !(~x~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {97661#false} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-28 10:14:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:12,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205490417] [2022-04-28 10:14:12,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205490417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:12,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283432435] [2022-04-28 10:14:12,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:12,614 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:12,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 10:14:12,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:12,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:12,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:13,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97660#true} is VALID [2022-04-28 10:14:13,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#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); {97660#true} is VALID [2022-04-28 10:14:13,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-28 10:14:13,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-28 10:14:13,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-28 10:14:13,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97665#(= main_~y~0 0)} is VALID [2022-04-28 10:14:13,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {97665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:13,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:13,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:13,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:13,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:13,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:13,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:13,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:13,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:13,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:13,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:13,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:13,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:13,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 main_~z~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; {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:13,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:13,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {97740#(and (<= main_~z~0 6) (<= 6 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; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:13,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 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; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:13,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:13,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {97756#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:13,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {97756#(and (<= main_~z~0 10) (<= 10 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; {97760#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:13,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {97760#(and (<= main_~z~0 11) (<= 11 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; {97764#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:13,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {97764#(and (<= main_~z~0 12) (<= 12 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; {97768#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:13,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {97768#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {97772#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:13,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {97772#(and (<= 14 main_~z~0) (<= main_~z~0 14))} 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; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:13,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:13,103 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-28 10:14:13,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-28 10:14:13,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-28 10:14:13,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-28 10:14:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:14:13,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:13,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-28 10:14:13,675 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {97838#(< 0 (mod (+ main_~z~0 1) 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; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:13,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {97842#(< 0 (mod (+ main_~z~0 2) 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; {97838#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:13,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {97846#(< 0 (mod (+ main_~z~0 3) 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; {97842#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:14:13,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {97850#(< 0 (mod (+ main_~z~0 4) 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; {97846#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:14:13,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {97854#(< 0 (mod (+ 5 main_~z~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; {97850#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:14:13,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {97858#(< 0 (mod (+ main_~z~0 6) 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; {97854#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:13,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {97862#(< 0 (mod (+ 7 main_~z~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; {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:14:13,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {97866#(< 0 (mod (+ main_~z~0 8) 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; {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:13,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {97870#(< 0 (mod (+ main_~z~0 9) 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; {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:14:13,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:14:13,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {97866#(< 0 (mod (+ main_~z~0 8) 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; {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:14:13,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {97862#(< 0 (mod (+ 7 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; {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:14:13,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {97858#(< 0 (mod (+ main_~z~0 6) 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; {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:13,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:14:13,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:13,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {97893#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:13,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {97897#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97893#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:13,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {97901#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97897#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:13,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {97905#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97901#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:13,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {97909#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97905#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:13,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {97913#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97909#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:13,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {97917#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97913#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:13,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {97921#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97917#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:13,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {97925#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97921#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:13,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97925#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:13,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-28 10:14:13,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-28 10:14:13,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-28 10:14:13,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#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); {97660#true} is VALID [2022-04-28 10:14:13,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97660#true} is VALID [2022-04-28 10:14:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:14:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283432435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:13,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:13,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 44 [2022-04-28 10:14:13,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:13,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840029655] [2022-04-28 10:14:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840029655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633550023] [2022-04-28 10:14:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:13,694 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 40 [2022-04-28 10:14:13,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:13,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:13,712 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 10:14:13,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:14:13,713 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:20,931 INFO L93 Difference]: Finished difference Result 573 states and 720 transitions. [2022-04-28 10:14:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 40 [2022-04-28 10:14:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-28 10:14:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-28 10:14:20,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 132 transitions. [2022-04-28 10:14:21,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:21,043 INFO L225 Difference]: With dead ends: 573 [2022-04-28 10:14:21,043 INFO L226 Difference]: Without dead ends: 553 [2022-04-28 10:14:21,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:14:21,044 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:21,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 124 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-04-28 10:14:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2022-04-28 10:14:22,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:22,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 10:14:22,965 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 10:14:22,966 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 10:14:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,976 INFO L93 Difference]: Finished difference Result 553 states and 699 transitions. [2022-04-28 10:14:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 699 transitions. [2022-04-28 10:14:22,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 553 states. [2022-04-28 10:14:22,977 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 553 states. [2022-04-28 10:14:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,992 INFO L93 Difference]: Finished difference Result 553 states and 699 transitions. [2022-04-28 10:14:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 699 transitions. [2022-04-28 10:14:22,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:22,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 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 10:14:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 489 transitions. [2022-04-28 10:14:23,002 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 489 transitions. Word has length 40 [2022-04-28 10:14:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:23,002 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 489 transitions. [2022-04-28 10:14:23,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:23,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 489 transitions. [2022-04-28 10:14:25,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 489 transitions. [2022-04-28 10:14:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:14:25,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:25,793 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:25,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:25,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-04-28 10:14:25,994 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 63 times [2022-04-28 10:14:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720920580] [2022-04-28 10:14:25,996 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:25,996 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 64 times [2022-04-28 10:14:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:25,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116955973] [2022-04-28 10:14:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:26,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {101021#(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); {101002#true} is VALID [2022-04-28 10:14:26,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-28 10:14:26,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-28 10:14:26,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:26,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {101021#(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); {101002#true} is VALID [2022-04-28 10:14:26,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-28 10:14:26,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-28 10:14:26,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-28 10:14:26,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101007#(= main_~y~0 0)} is VALID [2022-04-28 10:14:26,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {101007#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:26,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:26,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:26,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:26,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:26,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:26,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:26,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:26,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:26,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:26,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:26,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:26,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {101018#(and (<= main_~z~0 10) (<= 10 main_~z~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; {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {101020#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {101020#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-28 10:14:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:26,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116955973] [2022-04-28 10:14:26,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116955973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:26,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288670328] [2022-04-28 10:14:26,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:26,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:26,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:26,240 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:26,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 10:14:26,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:26,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:26,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:26,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:26,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101002#true} is VALID [2022-04-28 10:14:26,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#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); {101002#true} is VALID [2022-04-28 10:14:26,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-28 10:14:26,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-28 10:14:26,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-28 10:14:26,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101007#(= main_~y~0 0)} is VALID [2022-04-28 10:14:26,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {101007#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:26,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:26,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:26,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:26,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:26,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:26,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:26,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:26,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:26,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:26,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:26,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:26,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {101018#(and (<= main_~z~0 10) (<= 10 main_~z~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; {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {101082#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {101082#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-28 10:14:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:26,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:26,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} 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; {101003#false} is VALID [2022-04-28 10:14:26,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {101200#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-28 10:14:26,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {101204#(< 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; {101200#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:26,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {101208#(< 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; {101204#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:26,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {101208#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:26,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:26,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {101219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:26,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {101223#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:26,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {101227#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101223#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:26,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {101231#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:26,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {101235#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:26,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {101239#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:26,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {101243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:26,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {101247#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {101251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101247#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:26,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {101255#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101255#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:26,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-28 10:14:26,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-28 10:14:26,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-28 10:14:26,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#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); {101002#true} is VALID [2022-04-28 10:14:26,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101002#true} is VALID [2022-04-28 10:14:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288670328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:26,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:26,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720920580] [2022-04-28 10:14:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720920580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:26,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518799941] [2022-04-28 10:14:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:26,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 40 [2022-04-28 10:14:26,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:26,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:26,955 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 10:14:26,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:26,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:26,956 INFO L87 Difference]: Start difference. First operand 382 states and 489 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:34,392 INFO L93 Difference]: Finished difference Result 606 states and 757 transitions. [2022-04-28 10:14:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:14:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 40 [2022-04-28 10:14:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-28 10:14:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-28 10:14:34,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2022-04-28 10:14:34,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:34,518 INFO L225 Difference]: With dead ends: 606 [2022-04-28 10:14:34,519 INFO L226 Difference]: Without dead ends: 586 [2022-04-28 10:14:34,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:14:34,519 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 92 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:34,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 121 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:14:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-04-28 10:14:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 382. [2022-04-28 10:14:36,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:36,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 10:14:36,458 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 10:14:36,458 INFO L87 Difference]: Start difference. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 10:14:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:36,469 INFO L93 Difference]: Finished difference Result 586 states and 736 transitions. [2022-04-28 10:14:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 736 transitions. [2022-04-28 10:14:36,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:36,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:36,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 586 states. [2022-04-28 10:14:36,470 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 586 states. [2022-04-28 10:14:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:36,482 INFO L93 Difference]: Finished difference Result 586 states and 736 transitions. [2022-04-28 10:14:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 736 transitions. [2022-04-28 10:14:36,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:36,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:36,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:36,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 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 10:14:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 488 transitions. [2022-04-28 10:14:36,490 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 488 transitions. Word has length 40 [2022-04-28 10:14:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:36,490 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 488 transitions. [2022-04-28 10:14:36,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 10:14:36,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 488 transitions. [2022-04-28 10:14:39,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 488 transitions. [2022-04-28 10:14:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:14:39,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:39,735 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:39,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-28 10:14:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:39,935 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1947589458, now seen corresponding path program 65 times [2022-04-28 10:14:39,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:39,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106911370] [2022-04-28 10:14:39,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:39,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1947589458, now seen corresponding path program 66 times [2022-04-28 10:14:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942347760] [2022-04-28 10:14:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {104487#(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); {104458#true} is VALID [2022-04-28 10:14:40,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-28 10:14:40,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-28 10:14:40,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {104487#(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); {104458#true} is VALID [2022-04-28 10:14:40,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-28 10:14:40,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-28 10:14:40,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-28 10:14:40,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104463#(= main_~y~0 0)} is VALID [2022-04-28 10:14:40,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {104463#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:40,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {104464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:40,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {104465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:40,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {104466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:40,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {104467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:40,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {104468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:40,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {104469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:40,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {104470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:40,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {104471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:40,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {104472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:40,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {104473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:40,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {104474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:40,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {104475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:40,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {104476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:40,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {104477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:40,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {104478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:40,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {104479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:40,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {104480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:40,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:40,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {104482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:40,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {104483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:40,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:40,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {104485#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:40,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {104485#(and (<= main_~z~0 21) (<= 21 main_~z~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; {104486#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {104486#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {104459#false} 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; {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {104459#false} assume !(~y~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {104459#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {104459#false} assume !(~x~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {104459#false} assume !(~z~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L272 TraceCheckUtils]: 36: Hoare triple {104459#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {104459#false} ~cond := #in~cond; {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {104459#false} assume 0 == ~cond; {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-28 10:14:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:14:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:40,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942347760] [2022-04-28 10:14:40,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942347760] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603746547] [2022-04-28 10:14:40,346 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:40,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:40,347 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:40,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 10:14:40,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:14:40,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:40,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:14:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:40,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#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); {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {104458#true} assume !(~x~0 % 4294967296 > 0); {104458#true} is VALID [2022-04-28 10:14:40,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {104458#true} ~z~0 := ~y~0; {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:40,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {104575#(= 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; {104579#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:14:40,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {104579#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {104579#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:14:40,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {104579#(= 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; {104586#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:14:40,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {104586#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {104586#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:14:40,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {104586#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:40,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {104575#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:40,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {104575#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {104599#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:40,682 INFO L272 TraceCheckUtils]: 36: Hoare triple {104599#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:40,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {104607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:40,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {104607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104459#false} is VALID [2022-04-28 10:14:40,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-28 10:14:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 10:14:40,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:40,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-28 10:14:40,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {104607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104459#false} is VALID [2022-04-28 10:14:40,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {104607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:40,946 INFO L272 TraceCheckUtils]: 36: Hoare triple {104599#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:40,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {104599#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:40,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:14:40,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:14:40,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:14:40,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:14:40,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:14:40,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {104458#true} ~z~0 := ~y~0; {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {104458#true} assume !(~x~0 % 4294967296 > 0); {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-28 10:14:40,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-28 10:14:40,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-28 10:14:40,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#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); {104458#true} is VALID [2022-04-28 10:14:40,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104458#true} is VALID [2022-04-28 10:14:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 10:14:40,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603746547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:40,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:40,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8, 8] total 36 [2022-04-28 10:14:40,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:40,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106911370] [2022-04-28 10:14:40,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106911370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:40,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:40,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:14:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090709208] [2022-04-28 10:14:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 40 [2022-04-28 10:14:40,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:40,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 10:14:40,977 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 10:14:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:14:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:14:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:14:40,978 INFO L87 Difference]: Start difference. First operand 382 states and 488 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 10:14:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,388 INFO L93 Difference]: Finished difference Result 858 states and 1206 transitions. [2022-04-28 10:14:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:14:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 40 [2022-04-28 10:14:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 10:14:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 278 transitions. [2022-04-28 10:14:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 10:14:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 278 transitions. [2022-04-28 10:14:57,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 278 transitions. [2022-04-28 10:14:57,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:57,627 INFO L225 Difference]: With dead ends: 858 [2022-04-28 10:14:57,627 INFO L226 Difference]: Without dead ends: 830 [2022-04-28 10:14:57,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=3458, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:14:57,627 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 207 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5333 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 5333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:57,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 246 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 5333 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 10:14:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-04-28 10:14:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 398. [2022-04-28 10:14:59,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:59,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 10:14:59,554 INFO L74 IsIncluded]: Start isIncluded. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 10:14:59,554 INFO L87 Difference]: Start difference. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 10:14:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:59,574 INFO L93 Difference]: Finished difference Result 830 states and 1042 transitions. [2022-04-28 10:14:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1042 transitions. [2022-04-28 10:14:59,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:59,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:59,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 830 states. [2022-04-28 10:14:59,575 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 830 states. [2022-04-28 10:14:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:59,596 INFO L93 Difference]: Finished difference Result 830 states and 1042 transitions. [2022-04-28 10:14:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1042 transitions. [2022-04-28 10:14:59,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:59,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:59,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:59,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 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 10:14:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2022-04-28 10:14:59,604 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 511 transitions. Word has length 40 [2022-04-28 10:14:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:59,604 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 511 transitions. [2022-04-28 10:14:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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 10:14:59,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 511 transitions. [2022-04-28 10:15:02,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 511 transitions. [2022-04-28 10:15:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:02,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:02,314 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:02,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:02,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:02,515 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 17 times [2022-04-28 10:15:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:02,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2084471795] [2022-04-28 10:15:02,517 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:02,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 18 times [2022-04-28 10:15:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532258444] [2022-04-28 10:15:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {108972#(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); {108958#true} is VALID [2022-04-28 10:15:02,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-28 10:15:02,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-28 10:15:02,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:02,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {108972#(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); {108958#true} is VALID [2022-04-28 10:15:02,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-28 10:15:02,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-28 10:15:02,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-28 10:15:02,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108963#(= main_~y~0 0)} is VALID [2022-04-28 10:15:02,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 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; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 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; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~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; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~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; {108963#(= main_~y~0 0)} is VALID [2022-04-28 10:15:02,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {108963#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {108963#(= main_~y~0 0)} is VALID [2022-04-28 10:15:02,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:15:02,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:15:02,708 INFO L272 TraceCheckUtils]: 37: Hoare triple {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {108970#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:15:02,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {108970#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {108971#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:15:02,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {108971#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {108959#false} is VALID [2022-04-28 10:15:02,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-28 10:15:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:15:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532258444] [2022-04-28 10:15:02,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532258444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103934975] [2022-04-28 10:15:02,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:02,711 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 10:15:02,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:15:02,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:02,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 10:15:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:03,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108958#true} is VALID [2022-04-28 10:15:03,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#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); {108958#true} is VALID [2022-04-28 10:15:03,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-28 10:15:03,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-28 10:15:03,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-28 10:15:03,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108963#(= main_~y~0 0)} is VALID [2022-04-28 10:15:03,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:03,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:03,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:03,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:03,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {109016#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:03,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {109016#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= 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; {109020#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {109020#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {109024#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {109024#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} 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; {109028#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {109028#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} 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; {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} 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; {109039#(and (= (+ main_~y~0 (- 3)) main_~z~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:03,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {109039#(and (= (+ main_~y~0 (- 3)) main_~z~0) (<= main_~y~0 4) (<= 4 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; {109043#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:15:03,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {109043#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~z~0 (+ (- 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; {109047#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:15:03,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {109047#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= main_~z~0 (+ main_~y~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; {109051#(and (<= 4 main_~z~0) (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:03,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {109051#(and (<= 4 main_~z~0) (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (<= main_~z~0 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; {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:03,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:03,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109062#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ main_~z~0 (- 4))))} is VALID [2022-04-28 10:15:03,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {109062#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ main_~z~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109066#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 (- 4))))} is VALID [2022-04-28 10:15:03,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {109066#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109070#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 4))) (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:03,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {109070#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 4))) (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109074#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:15:03,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {109074#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:03,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109084#(and (<= 4 main_~z~0) (<= main_~z~0 4) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-28 10:15:03,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {109084#(and (<= 4 main_~z~0) (<= main_~z~0 4) (= (+ main_~z~0 1) (+ main_~y~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109088#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= (+ main_~y~0 2) (+ main_~z~0 2)))} is VALID [2022-04-28 10:15:03,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {109088#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= (+ main_~y~0 2) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109092#(and (<= main_~z~0 2) (<= 2 main_~z~0) (= (+ main_~z~0 3) (+ main_~y~0 3)))} is VALID [2022-04-28 10:15:03,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {109092#(and (<= main_~z~0 2) (<= 2 main_~z~0) (= (+ main_~z~0 3) (+ main_~y~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109096#(and (= (+ main_~y~0 4) (+ main_~z~0 4)) (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:03,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {109096#(and (= (+ main_~y~0 4) (+ main_~z~0 4)) (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109100#(and (<= 0 main_~y~0) (<= main_~y~0 0) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-28 10:15:03,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {109100#(and (<= 0 main_~y~0) (<= main_~y~0 0) (= (+ main_~z~0 1) (+ main_~y~0 1)))} assume !(~z~0 % 4294967296 > 0); {108963#(= main_~y~0 0)} is VALID [2022-04-28 10:15:03,454 INFO L272 TraceCheckUtils]: 37: Hoare triple {108963#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:15:03,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:15:03,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {109111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {108959#false} is VALID [2022-04-28 10:15:03,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-28 10:15:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:03,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:04,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-28 10:15:04,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {109111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {108959#false} is VALID [2022-04-28 10:15:04,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:15:04,335 INFO L272 TraceCheckUtils]: 37: Hoare triple {109127#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:15:04,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {109131#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109127#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:15:04,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {109135#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109131#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:15:04,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {109139#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109135#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:04,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {109143#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109139#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:15:04,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {109147#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109143#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:15:04,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109147#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {109158#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {109162#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109158#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {109166#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109162#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {109170#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109166#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:15:04,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109170#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {109181#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~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; {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {109185#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 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; {109181#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {109189#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~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; {109185#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:15:04,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {109193#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~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; {109189#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:15:04,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~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; {109193#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:04,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:15:04,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {109204#(or (= (mod (+ 4294967291 main_~y~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; {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:15:04,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {109208#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 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; {109204#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:04,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {109212#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 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; {109208#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:15:04,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {109216#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 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; {109212#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:15:04,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 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; {109216#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {108958#true} ~z~0 := ~y~0; {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {108958#true} assume !(~x~0 % 4294967296 > 0); {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#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); {108958#true} is VALID [2022-04-28 10:15:04,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108958#true} is VALID [2022-04-28 10:15:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:15:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103934975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:04,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30, 25] total 55 [2022-04-28 10:15:04,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2084471795] [2022-04-28 10:15:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2084471795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:04,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:15:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71677861] [2022-04-28 10:15:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 41 [2022-04-28 10:15:04,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:04,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 10:15:04,381 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 10:15:04,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:15:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:04,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:15:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=2466, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:15:04,381 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 10:15:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:07,001 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-04-28 10:15:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:15:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 41 [2022-04-28 10:15:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 10:15:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 10:15:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 10:15:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 10:15:07,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-28 10:15:07,043 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 10:15:07,050 INFO L225 Difference]: With dead ends: 410 [2022-04-28 10:15:07,050 INFO L226 Difference]: Without dead ends: 399 [2022-04-28 10:15:07,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=560, Invalid=3346, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:15:07,051 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:07,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 56 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:15:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-28 10:15:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2022-04-28 10:15:09,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:09,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 10:15:09,046 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 10:15:09,047 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 10:15:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:09,055 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-28 10:15:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-28 10:15:09,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:09,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:09,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 399 states. [2022-04-28 10:15:09,056 INFO L87 Difference]: Start difference. First operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 399 states. [2022-04-28 10:15:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:09,062 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-28 10:15:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-28 10:15:09,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:09,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:09,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:09,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 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 10:15:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 512 transitions. [2022-04-28 10:15:09,070 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 512 transitions. Word has length 41 [2022-04-28 10:15:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:09,070 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 512 transitions. [2022-04-28 10:15:09,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 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 10:15:09,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 512 transitions. [2022-04-28 10:15:11,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-28 10:15:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:11,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:11,680 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:11,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-28 10:15:11,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-28 10:15:11,880 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:11,881 INFO L85 PathProgramCache]: Analyzing trace with hash -134128447, now seen corresponding path program 35 times [2022-04-28 10:15:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:11,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299449636] [2022-04-28 10:15:11,883 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:11,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -134128447, now seen corresponding path program 36 times [2022-04-28 10:15:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:11,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927174199] [2022-04-28 10:15:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:12,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {111717#(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); {111693#true} is VALID [2022-04-28 10:15:12,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-28 10:15:12,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-28 10:15:12,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:12,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {111717#(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); {111693#true} is VALID [2022-04-28 10:15:12,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-28 10:15:12,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-28 10:15:12,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-28 10:15:12,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111698#(= main_~y~0 0)} is VALID [2022-04-28 10:15:12,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {111698#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:12,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:12,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:12,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:12,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:12,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:12,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:12,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:12,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:12,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:12,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~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; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:12,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~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; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:12,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~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; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:12,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:12,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~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; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:12,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~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; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:12,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~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; {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:12,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:12,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 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; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:12,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {111714#(and (<= main_~z~0 1) (<= 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; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:12,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 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; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:12,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 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; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:12,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 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; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:12,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {111710#(and (<= main_~z~0 5) (<= 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; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:12,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 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; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:12,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 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; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:12,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {111716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-28 10:15:12,264 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-28 10:15:12,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-28 10:15:12,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-28 10:15:12,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-28 10:15:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927174199] [2022-04-28 10:15:12,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927174199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551443300] [2022-04-28 10:15:12,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:12,266 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 10:15:12,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:15:12,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:12,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:15:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:12,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:12,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111693#true} is VALID [2022-04-28 10:15:12,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#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); {111693#true} is VALID [2022-04-28 10:15:12,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-28 10:15:12,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-28 10:15:12,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-28 10:15:12,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111698#(= main_~y~0 0)} is VALID [2022-04-28 10:15:12,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {111698#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:12,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:12,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:12,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:12,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:12,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:12,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:12,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:12,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:12,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:12,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~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; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:12,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~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; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:12,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~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; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:12,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:12,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~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; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:12,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~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; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:12,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~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; {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:12,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:12,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 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; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:12,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {111714#(and (<= main_~z~0 1) (<= 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; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:12,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 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; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:12,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 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; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:12,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 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; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:12,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {111710#(and (<= main_~z~0 5) (<= 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; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:12,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 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; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:12,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 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; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:12,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:12,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-28 10:15:12,763 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-28 10:15:12,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-28 10:15:12,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-28 10:15:12,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-28 10:15:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:12,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:13,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-28 10:15:13,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-28 10:15:13,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-28 10:15:13,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-28 10:15:13,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {111853#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-28 10:15:13,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:13,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {111853#(< 0 (mod main_~z~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; {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {111870#(< 0 (mod (+ main_~z~0 1) 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; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:13,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {111874#(< 0 (mod (+ main_~z~0 2) 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; {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:15:13,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {111878#(< 0 (mod (+ main_~z~0 3) 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; {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:15:13,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {111882#(< 0 (mod (+ main_~z~0 4) 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; {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:15:13,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {111886#(< 0 (mod (+ 5 main_~z~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; {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:15:13,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {111890#(< 0 (mod (+ main_~z~0 6) 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; {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:13,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {111894#(< 0 (mod (+ 7 main_~z~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; {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:15:13,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:13,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {111890#(< 0 (mod (+ main_~z~0 6) 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; {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:13,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {111886#(< 0 (mod (+ 5 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; {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:15:13,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {111882#(< 0 (mod (+ main_~z~0 4) 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; {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:13,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {111878#(< 0 (mod (+ main_~z~0 3) 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; {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:15:13,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {111874#(< 0 (mod (+ main_~z~0 2) 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; {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:15:13,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {111870#(< 0 (mod (+ main_~z~0 1) 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; {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:15:13,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {111853#(< 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; {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:15:13,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {111857#(< 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; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:13,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {111932#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:13,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {111936#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111932#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:13,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {111940#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111936#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:13,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {111944#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111940#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:13,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {111948#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111944#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:13,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {111952#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111948#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:13,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {111956#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111952#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:13,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {111960#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111956#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:13,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111960#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:13,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-28 10:15:13,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-28 10:15:13,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-28 10:15:13,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#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); {111693#true} is VALID [2022-04-28 10:15:13,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111693#true} is VALID [2022-04-28 10:15:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551443300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:13,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2022-04-28 10:15:13,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:13,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299449636] [2022-04-28 10:15:13,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299449636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:13,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:13,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:15:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618985959] [2022-04-28 10:15:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 41 [2022-04-28 10:15:13,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:13,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 10:15:13,360 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 10:15:13,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:15:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:13,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:15:13,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:15:13,360 INFO L87 Difference]: Start difference. First operand 399 states and 512 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 10:15:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:25,325 INFO L93 Difference]: Finished difference Result 568 states and 762 transitions. [2022-04-28 10:15:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-28 10:15:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 41 [2022-04-28 10:15:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 10:15:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 312 transitions. [2022-04-28 10:15:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 10:15:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 312 transitions. [2022-04-28 10:15:25,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 312 transitions. [2022-04-28 10:15:25,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:25,607 INFO L225 Difference]: With dead ends: 568 [2022-04-28 10:15:25,607 INFO L226 Difference]: Without dead ends: 549 [2022-04-28 10:15:25,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2454, Invalid=16452, Unknown=0, NotChecked=0, Total=18906 [2022-04-28 10:15:25,609 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:25,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 130 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:15:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-28 10:15:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 410. [2022-04-28 10:15:27,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:27,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 10:15:27,703 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 10:15:27,703 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 10:15:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:27,712 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2022-04-28 10:15:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 686 transitions. [2022-04-28 10:15:27,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:27,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 549 states. [2022-04-28 10:15:27,713 INFO L87 Difference]: Start difference. First operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 549 states. [2022-04-28 10:15:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:27,722 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2022-04-28 10:15:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 686 transitions. [2022-04-28 10:15:27,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:27,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:27,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:27,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 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 10:15:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 523 transitions. [2022-04-28 10:15:27,730 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 523 transitions. Word has length 41 [2022-04-28 10:15:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:27,730 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 523 transitions. [2022-04-28 10:15:27,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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 10:15:27,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 410 states and 523 transitions. [2022-04-28 10:15:31,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 523 transitions. [2022-04-28 10:15:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:31,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:31,229 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:31,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-28 10:15:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-28 10:15:31,430 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash -270255777, now seen corresponding path program 67 times [2022-04-28 10:15:31,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:31,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448868074] [2022-04-28 10:15:31,432 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:31,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -270255777, now seen corresponding path program 68 times [2022-04-28 10:15:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:31,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390033225] [2022-04-28 10:15:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:31,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {115261#(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); {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:31,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {115261#(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); {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-28 10:15:31,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-28 10:15:31,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115236#(= main_~y~0 0)} is VALID [2022-04-28 10:15:31,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {115236#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:31,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:31,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:31,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:31,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:31,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:31,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:31,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:31,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:31,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:31,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:31,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:31,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:31,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:31,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:31,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:31,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:31,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:31,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:31,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:31,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:31,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:31,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:31,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {115259#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:15:31,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {115259#(and (<= 22 main_~z~0) (<= main_~z~0 22))} 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; {115260#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:15:31,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {115260#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:31,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {115232#false} 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; {115232#false} is VALID [2022-04-28 10:15:31,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {115232#false} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:31,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-28 10:15:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:15:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:31,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390033225] [2022-04-28 10:15:31,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390033225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:31,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694668503] [2022-04-28 10:15:31,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:31,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:31,856 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:31,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 10:15:31,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:31,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:31,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:15:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:31,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:32,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115231#true} is VALID [2022-04-28 10:15:32,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#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); {115231#true} is VALID [2022-04-28 10:15:32,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-28 10:15:32,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-28 10:15:32,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-28 10:15:32,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115236#(= main_~y~0 0)} is VALID [2022-04-28 10:15:32,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {115236#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:32,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:32,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:32,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:32,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:32,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:32,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:32,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:32,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:32,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:32,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:32,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:32,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:32,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:32,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:32,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:32,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:32,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:32,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:32,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:32,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:32,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:32,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:32,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:32,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 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; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:32,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:32,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 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; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-28 10:15:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:15:32,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:33,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-28 10:15:33,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {115406#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-28 10:15:33,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {115410#(< 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; {115406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:33,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:33,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {115410#(< 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; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:33,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:33,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:33,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {115406#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:33,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {115429#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:33,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {115433#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115429#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:33,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {115437#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115433#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:33,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {115441#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115437#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:33,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {115445#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115441#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:33,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {115449#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115445#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:33,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {115453#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115449#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:33,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {115457#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115453#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:33,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {115461#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115457#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:33,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {115465#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115461#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:33,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {115469#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115465#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:33,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {115473#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115469#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:33,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {115477#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115473#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:33,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {115481#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115477#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:33,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {115485#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115481#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:33,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {115489#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115485#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:33,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {115493#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115489#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:33,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {115497#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115493#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:33,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {115501#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115497#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:33,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {115505#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115501#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:33,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {115509#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115505#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:33,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115509#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:33,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-28 10:15:33,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-28 10:15:33,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-28 10:15:33,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#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); {115231#true} is VALID [2022-04-28 10:15:33,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115231#true} is VALID [2022-04-28 10:15:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:15:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694668503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:33,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:33,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 51 [2022-04-28 10:15:33,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448868074] [2022-04-28 10:15:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448868074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:33,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:33,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:15:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226418734] [2022-04-28 10:15:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 41 [2022-04-28 10:15:33,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:33,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 10:15:33,121 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 10:15:33,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:15:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:33,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:15:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1923, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:15:33,122 INFO L87 Difference]: Start difference. First operand 410 states and 523 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 10:15:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:52,527 INFO L93 Difference]: Finished difference Result 951 states and 1339 transitions. [2022-04-28 10:15:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:15:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 41 [2022-04-28 10:15:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 10:15:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 290 transitions. [2022-04-28 10:15:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 10:15:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 290 transitions. [2022-04-28 10:15:52,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 290 transitions. [2022-04-28 10:15:52,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:52,779 INFO L225 Difference]: With dead ends: 951 [2022-04-28 10:15:52,780 INFO L226 Difference]: Without dead ends: 923 [2022-04-28 10:15:52,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1335, Invalid=4517, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 10:15:52,780 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 219 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5828 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 5828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:52,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 257 Invalid, 5988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 5828 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:15:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-04-28 10:15:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 426. [2022-04-28 10:15:54,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:54,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 10:15:54,861 INFO L74 IsIncluded]: Start isIncluded. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 10:15:54,861 INFO L87 Difference]: Start difference. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 10:15:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:54,887 INFO L93 Difference]: Finished difference Result 923 states and 1169 transitions. [2022-04-28 10:15:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1169 transitions. [2022-04-28 10:15:54,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:54,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:54,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 923 states. [2022-04-28 10:15:54,888 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 923 states. [2022-04-28 10:15:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:54,913 INFO L93 Difference]: Finished difference Result 923 states and 1169 transitions. [2022-04-28 10:15:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1169 transitions. [2022-04-28 10:15:54,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:54,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:54,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:54,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 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 10:15:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2022-04-28 10:15:54,922 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 41 [2022-04-28 10:15:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:54,922 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2022-04-28 10:15:54,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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 10:15:54,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 546 transitions. [2022-04-28 10:15:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-04-28 10:15:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:15:58,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:58,061 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:58,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:58,261 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1741037917, now seen corresponding path program 19 times [2022-04-28 10:15:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:58,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339732014] [2022-04-28 10:15:58,265 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:58,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1741037917, now seen corresponding path program 20 times [2022-04-28 10:15:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:58,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361249718] [2022-04-28 10:15:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {120193#(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); {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:58,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {120193#(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); {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-28 10:15:58,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= 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; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= 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; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= 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; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= 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; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-28 10:15:58,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-28 10:15:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:15:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:58,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361249718] [2022-04-28 10:15:58,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361249718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8846062] [2022-04-28 10:15:58,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:58,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:58,384 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:58,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 10:15:58,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:58,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:58,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:15:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:58,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#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); {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= 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; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= 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; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= 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; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= 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; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-28 10:15:58,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-28 10:15:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:15:58,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:58,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-28 10:15:58,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-28 10:15:58,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-28 10:15:58,957 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-28 10:15:58,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-28 10:15:58,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-28 10:15:58,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:58,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= 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; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= 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; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= 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; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:58,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= 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; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-28 10:15:58,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-28 10:15:58,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-28 10:15:58,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-28 10:15:58,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#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); {120182#true} is VALID [2022-04-28 10:15:58,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120182#true} is VALID [2022-04-28 10:15:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:15:58,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8846062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:58,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:58,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-28 10:15:58,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:58,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339732014] [2022-04-28 10:15:58,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339732014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:58,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:58,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:15:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106111157] [2022-04-28 10:15:58,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:58,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 42 [2022-04-28 10:15:58,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:58,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 10:15:58,994 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 10:15:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:15:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:15:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:15:58,994 INFO L87 Difference]: Start difference. First operand 426 states and 546 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 10:16:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:01,666 INFO L93 Difference]: Finished difference Result 445 states and 567 transitions. [2022-04-28 10:16:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:16:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 42 [2022-04-28 10:16:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 10:16:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 10:16:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 10:16:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 10:16:01,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 10:16:01,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:01,722 INFO L225 Difference]: With dead ends: 445 [2022-04-28 10:16:01,722 INFO L226 Difference]: Without dead ends: 412 [2022-04-28 10:16:01,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:16:01,723 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:01,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 63 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:16:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-28 10:16:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 407. [2022-04-28 10:16:03,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:03,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 10:16:03,709 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 10:16:03,709 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 10:16:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:03,715 INFO L93 Difference]: Finished difference Result 412 states and 530 transitions. [2022-04-28 10:16:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 530 transitions. [2022-04-28 10:16:03,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:03,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:03,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 412 states. [2022-04-28 10:16:03,716 INFO L87 Difference]: Start difference. First operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 412 states. [2022-04-28 10:16:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:03,722 INFO L93 Difference]: Finished difference Result 412 states and 530 transitions. [2022-04-28 10:16:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 530 transitions. [2022-04-28 10:16:03,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:03,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:03,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 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 10:16:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 525 transitions. [2022-04-28 10:16:03,729 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 525 transitions. Word has length 42 [2022-04-28 10:16:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:03,730 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 525 transitions. [2022-04-28 10:16:03,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 10:16:03,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 407 states and 525 transitions. [2022-04-28 10:16:07,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 525 transitions. [2022-04-28 10:16:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:16:07,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:07,067 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:07,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-04-28 10:16:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-28 10:16:07,283 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2141964876, now seen corresponding path program 69 times [2022-04-28 10:16:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:07,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201050747] [2022-04-28 10:16:07,285 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:07,285 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2141964876, now seen corresponding path program 70 times [2022-04-28 10:16:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:07,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072645067] [2022-04-28 10:16:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {123005#(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); {122985#true} is VALID [2022-04-28 10:16:07,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-28 10:16:07,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-28 10:16:07,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {123005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:07,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {123005#(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); {122985#true} is VALID [2022-04-28 10:16:07,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-28 10:16:07,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-28 10:16:07,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-28 10:16:07,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122990#(= main_~y~0 0)} is VALID [2022-04-28 10:16:07,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {122990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:07,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:07,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:07,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:07,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:07,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:07,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:07,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:07,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:07,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:07,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:07,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:07,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:07,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {123002#(and (<= main_~z~0 7) (<= 7 main_~z~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; {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {123003#(and (<= main_~z~0 6) (<= 6 main_~z~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; {123004#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {123004#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-28 10:16:07,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-28 10:16:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072645067] [2022-04-28 10:16:07,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072645067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720836682] [2022-04-28 10:16:07,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:07,517 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:07,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 10:16:07,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:07,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:07,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:07,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {122985#true} is VALID [2022-04-28 10:16:07,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#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); {122985#true} is VALID [2022-04-28 10:16:07,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-28 10:16:07,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-28 10:16:07,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-28 10:16:07,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122990#(= main_~y~0 0)} is VALID [2022-04-28 10:16:07,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {122990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:07,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:07,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:07,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:07,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:07,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:07,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:07,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:07,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:07,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:07,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:07,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:07,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:07,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {123002#(and (<= main_~z~0 7) (<= 7 main_~z~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; {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:07,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {123003#(and (<= main_~z~0 6) (<= 6 main_~z~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; {123069#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:07,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {123069#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-28 10:16:07,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-28 10:16:07,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-28 10:16:07,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-28 10:16:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:07,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:08,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} 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; {122986#false} is VALID [2022-04-28 10:16:08,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {123193#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-28 10:16:08,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {123197#(< 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; {123193#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:08,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {123201#(< 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; {123197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:08,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {123205#(< 0 (mod (+ main_~z~0 4294967293) 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; {123201#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:08,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {123209#(< 0 (mod (+ 4294967292 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; {123205#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:08,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {123209#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:08,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:08,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {123220#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:08,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {123224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123220#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:08,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {123228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:08,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {123232#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:08,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {123236#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123232#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:08,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {123240#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123236#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:08,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {123244#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123240#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:08,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {123248#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123244#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:08,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {123252#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123248#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:08,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123252#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:08,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-28 10:16:08,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-28 10:16:08,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-28 10:16:08,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#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); {122985#true} is VALID [2022-04-28 10:16:08,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {122985#true} is VALID [2022-04-28 10:16:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720836682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:08,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:08,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:08,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201050747] [2022-04-28 10:16:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201050747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:08,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:08,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888029974] [2022-04-28 10:16:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:16:08,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:08,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:08,240 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 10:16:08,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:08,241 INFO L87 Difference]: Start difference. First operand 407 states and 525 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:15,957 INFO L93 Difference]: Finished difference Result 594 states and 756 transitions. [2022-04-28 10:16:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:16:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:16:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 132 transitions. [2022-04-28 10:16:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 132 transitions. [2022-04-28 10:16:15,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 132 transitions. [2022-04-28 10:16:16,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:16,069 INFO L225 Difference]: With dead ends: 594 [2022-04-28 10:16:16,069 INFO L226 Difference]: Without dead ends: 573 [2022-04-28 10:16:16,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:16:16,070 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:16,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 126 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:16:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-04-28 10:16:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 407. [2022-04-28 10:16:18,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:18,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 10:16:18,041 INFO L74 IsIncluded]: Start isIncluded. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 10:16:18,041 INFO L87 Difference]: Start difference. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 10:16:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:18,051 INFO L93 Difference]: Finished difference Result 573 states and 734 transitions. [2022-04-28 10:16:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 734 transitions. [2022-04-28 10:16:18,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:18,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:18,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 573 states. [2022-04-28 10:16:18,052 INFO L87 Difference]: Start difference. First operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 573 states. [2022-04-28 10:16:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:18,062 INFO L93 Difference]: Finished difference Result 573 states and 734 transitions. [2022-04-28 10:16:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 734 transitions. [2022-04-28 10:16:18,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:18,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:18,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:18,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 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 10:16:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2022-04-28 10:16:18,070 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 42 [2022-04-28 10:16:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:18,070 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2022-04-28 10:16:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:18,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 407 states and 524 transitions. [2022-04-28 10:16:21,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2022-04-28 10:16:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:16:21,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:21,541 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:21,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:21,743 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2055519709, now seen corresponding path program 37 times [2022-04-28 10:16:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:21,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677488880] [2022-04-28 10:16:21,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:21,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2055519709, now seen corresponding path program 38 times [2022-04-28 10:16:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:21,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011775840] [2022-04-28 10:16:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {126492#(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); {126469#true} is VALID [2022-04-28 10:16:22,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-28 10:16:22,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-28 10:16:22,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:22,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {126492#(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); {126469#true} is VALID [2022-04-28 10:16:22,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-28 10:16:22,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-28 10:16:22,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-28 10:16:22,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126474#(= main_~y~0 0)} is VALID [2022-04-28 10:16:22,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {126474#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:22,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {126475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:22,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {126476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:22,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {126477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:22,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {126478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:22,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {126479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:22,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {126480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126481#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:22,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {126481#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126482#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:22,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {126482#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:22,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:22,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {126484#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:22,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {126484#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {126485#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:22,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {126485#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {126486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:22,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {126486#(and (<= main_~z~0 7) (<= 7 main_~z~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; {126487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:22,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {126487#(and (<= main_~z~0 6) (<= 6 main_~z~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; {126488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:22,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {126488#(and (<= main_~z~0 5) (<= 5 main_~z~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; {126489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:22,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {126489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {126490#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:22,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {126490#(and (<= main_~z~0 3) (<= 3 main_~z~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; {126491#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {126491#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {126470#false} 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; {126470#false} is VALID [2022-04-28 10:16:22,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {126470#false} assume !(~y~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {126470#false} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-28 10:16:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:16:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:22,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011775840] [2022-04-28 10:16:22,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011775840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:22,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176215510] [2022-04-28 10:16:22,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:22,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:22,056 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:22,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 10:16:22,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:22,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:22,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:16:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:22,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#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); {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-28 10:16:22,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-28 10:16:22,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:22,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:22,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:22,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:22,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:22,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {126544#(< 0 (mod (+ 7 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; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:22,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 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; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {126536#(< 0 (mod (+ 5 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; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:22,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 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; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:22,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 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; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:22,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 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; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:22,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-28 10:16:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 10:16:22,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:22,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-28 10:16:22,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-28 10:16:22,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-28 10:16:22,531 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-28 10:16:22,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-28 10:16:22,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-28 10:16:22,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {126572#(< 0 (mod main_~x~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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 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; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:22,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 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; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:22,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 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; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:22,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 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; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:22,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {126536#(< 0 (mod (+ 5 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; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:22,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 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; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {126544#(< 0 (mod (+ 7 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; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:22,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:22,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:22,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:22,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:22,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#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); {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126469#true} is VALID [2022-04-28 10:16:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 10:16:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176215510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:22,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 29 [2022-04-28 10:16:22,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677488880] [2022-04-28 10:16:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677488880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:22,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:22,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:16:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239920978] [2022-04-28 10:16:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-28 10:16:22,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:22,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:16:22,566 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 10:16:22,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:16:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:16:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:16:22,566 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:16:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:31,008 INFO L93 Difference]: Finished difference Result 593 states and 757 transitions. [2022-04-28 10:16:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:16:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-28 10:16:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:16:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2022-04-28 10:16:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:16:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2022-04-28 10:16:31,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 146 transitions. [2022-04-28 10:16:31,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:31,128 INFO L225 Difference]: With dead ends: 593 [2022-04-28 10:16:31,128 INFO L226 Difference]: Without dead ends: 542 [2022-04-28 10:16:31,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=302, Invalid=3858, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:16:31,128 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 70 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:31,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 141 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:16:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-28 10:16:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 408. [2022-04-28 10:16:33,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:33,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 10:16:33,099 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 10:16:33,099 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 10:16:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:33,108 INFO L93 Difference]: Finished difference Result 542 states and 701 transitions. [2022-04-28 10:16:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2022-04-28 10:16:33,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:33,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:33,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 542 states. [2022-04-28 10:16:33,109 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 542 states. [2022-04-28 10:16:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:33,118 INFO L93 Difference]: Finished difference Result 542 states and 701 transitions. [2022-04-28 10:16:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2022-04-28 10:16:33,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:33,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:33,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:33,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 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 10:16:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 523 transitions. [2022-04-28 10:16:33,126 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 523 transitions. Word has length 42 [2022-04-28 10:16:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:33,126 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 523 transitions. [2022-04-28 10:16:33,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 10:16:33,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 523 transitions. [2022-04-28 10:16:36,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2022-04-28 10:16:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:16:36,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:36,156 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:36,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:36,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:36,357 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 70932066, now seen corresponding path program 71 times [2022-04-28 10:16:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:36,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123112995] [2022-04-28 10:16:36,359 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:36,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash 70932066, now seen corresponding path program 72 times [2022-04-28 10:16:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:36,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305806103] [2022-04-28 10:16:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:36,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {129930#(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); {129910#true} is VALID [2022-04-28 10:16:36,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-28 10:16:36,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-28 10:16:36,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:36,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {129930#(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); {129910#true} is VALID [2022-04-28 10:16:36,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-28 10:16:36,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-28 10:16:36,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-28 10:16:36,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129915#(= main_~y~0 0)} is VALID [2022-04-28 10:16:36,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {129915#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:36,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:36,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:36,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:36,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:36,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:36,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:36,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:36,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:36,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:36,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:36,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:36,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {129926#(and (<= main_~z~0 10) (<= 10 main_~z~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; {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:36,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:36,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {129929#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {129929#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-28 10:16:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:36,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305806103] [2022-04-28 10:16:36,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305806103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:36,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48020781] [2022-04-28 10:16:36,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:36,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:36,608 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 10:16:36,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:16:36,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:36,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:36,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:37,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129910#true} is VALID [2022-04-28 10:16:37,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#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); {129910#true} is VALID [2022-04-28 10:16:37,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-28 10:16:37,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-28 10:16:37,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-28 10:16:37,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129915#(= main_~y~0 0)} is VALID [2022-04-28 10:16:37,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {129915#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:37,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:37,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:37,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:37,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:37,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:37,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:37,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:37,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:37,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:37,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:37,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:37,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {129926#(and (<= main_~z~0 10) (<= 10 main_~z~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; {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:37,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:37,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {129994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:37,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {129994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-28 10:16:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:37,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} 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; {129911#false} is VALID [2022-04-28 10:16:37,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {130118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-28 10:16:37,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {130122#(< 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; {130118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:37,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {130126#(< 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; {130122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:37,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {130130#(< 0 (mod (+ main_~z~0 4294967293) 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; {130126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:37,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {130130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:37,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:37,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {130141#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:37,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {130145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130141#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:37,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {130149#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:37,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {130153#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130149#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:37,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {130157#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130153#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:37,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {130161#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130157#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:37,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {130165#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130161#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:37,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {130169#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130165#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:37,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {130173#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130169#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:37,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {130177#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130173#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:37,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130177#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:37,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-28 10:16:37,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-28 10:16:37,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-28 10:16:37,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#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); {129910#true} is VALID [2022-04-28 10:16:37,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129910#true} is VALID [2022-04-28 10:16:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48020781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:37,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:37,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:37,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123112995] [2022-04-28 10:16:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123112995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:37,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77956290] [2022-04-28 10:16:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:37,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:16:37,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:37,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:37,529 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 10:16:37,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:37,530 INFO L87 Difference]: Start difference. First operand 408 states and 523 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:45,802 INFO L93 Difference]: Finished difference Result 629 states and 793 transitions. [2022-04-28 10:16:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:16:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:16:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-04-28 10:16:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-04-28 10:16:45,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 139 transitions. [2022-04-28 10:16:45,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:45,927 INFO L225 Difference]: With dead ends: 629 [2022-04-28 10:16:45,927 INFO L226 Difference]: Without dead ends: 608 [2022-04-28 10:16:45,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:16:45,927 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:45,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 127 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:16:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-04-28 10:16:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 408. [2022-04-28 10:16:47,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:47,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 10:16:47,910 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 10:16:47,910 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 10:16:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:47,921 INFO L93 Difference]: Finished difference Result 608 states and 771 transitions. [2022-04-28 10:16:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 771 transitions. [2022-04-28 10:16:47,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:47,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:47,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 608 states. [2022-04-28 10:16:47,922 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 608 states. [2022-04-28 10:16:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:47,932 INFO L93 Difference]: Finished difference Result 608 states and 771 transitions. [2022-04-28 10:16:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 771 transitions. [2022-04-28 10:16:47,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:47,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:47,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:47,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 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 10:16:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 522 transitions. [2022-04-28 10:16:47,941 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 522 transitions. Word has length 42 [2022-04-28 10:16:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:47,941 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 522 transitions. [2022-04-28 10:16:47,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:47,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 522 transitions. [2022-04-28 10:16:51,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 522 transitions. [2022-04-28 10:16:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:16:51,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:51,469 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:51,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:51,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-04-28 10:16:51,669 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1943431156, now seen corresponding path program 73 times [2022-04-28 10:16:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:51,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29154745] [2022-04-28 10:16:51,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:51,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1943431156, now seen corresponding path program 74 times [2022-04-28 10:16:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:51,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56007445] [2022-04-28 10:16:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {133550#(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); {133530#true} is VALID [2022-04-28 10:16:51,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-28 10:16:51,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-28 10:16:51,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {133550#(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); {133530#true} is VALID [2022-04-28 10:16:51,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-28 10:16:51,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-28 10:16:51,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-28 10:16:51,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133535#(= main_~y~0 0)} is VALID [2022-04-28 10:16:51,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {133535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:51,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:51,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:51,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:51,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:51,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:51,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:51,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:51,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:51,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:51,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:51,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:51,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:51,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 main_~z~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; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 main_~z~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; {133549#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {133549#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {133531#false} 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; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {133531#false} assume !(~y~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {133531#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {133531#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {133531#false} assume !(~x~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {133531#false} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-28 10:16:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:51,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56007445] [2022-04-28 10:16:51,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56007445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:51,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276987530] [2022-04-28 10:16:51,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:51,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:51,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:51,927 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:51,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-28 10:16:51,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:51,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:51,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:16:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:52,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133530#true} is VALID [2022-04-28 10:16:52,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#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); {133530#true} is VALID [2022-04-28 10:16:52,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-28 10:16:52,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-28 10:16:52,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-28 10:16:52,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133535#(= main_~y~0 0)} is VALID [2022-04-28 10:16:52,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {133535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:52,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:52,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:52,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:52,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:52,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:52,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:52,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:52,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:52,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:52,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:52,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:52,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:52,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 main_~z~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; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:52,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 main_~z~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; {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:52,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:52,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:52,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 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; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:52,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 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; {133627#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {133627#(and (<= main_~z~0 12) (<= 12 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; {133631#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {133631#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {133635#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {133635#(and (<= 14 main_~z~0) (<= main_~z~0 14))} 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; {133639#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {133639#(and (<= main_~z~0 15) (<= 15 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; {133643#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:16:52,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {133643#(and (<= 16 main_~z~0) (<= main_~z~0 16))} 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; {133647#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:16:52,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {133647#(and (<= 17 main_~z~0) (<= main_~z~0 17))} 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; {133651#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:16:52,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {133651#(and (<= 18 main_~z~0) (<= main_~z~0 18))} 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; {133655#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:16:52,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {133655#(and (<= 19 main_~z~0) (<= main_~z~0 19))} 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; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:52,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:52,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:52,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:52,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:52,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:52,491 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-28 10:16:52,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-28 10:16:52,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-28 10:16:52,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-28 10:16:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:16:52,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:53,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-28 10:16:53,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-28 10:16:53,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-28 10:16:53,231 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-28 10:16:53,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-28 10:16:53,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {133715#(< 0 (mod (+ main_~z~0 1) 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; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {133719#(< 0 (mod (+ main_~z~0 2) 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; {133715#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:16:53,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {133723#(< 0 (mod (+ main_~z~0 3) 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; {133719#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:16:53,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {133727#(< 0 (mod (+ main_~z~0 4) 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; {133723#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:16:53,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {133731#(< 0 (mod (+ 5 main_~z~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; {133727#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:16:53,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {133735#(< 0 (mod (+ main_~z~0 6) 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; {133731#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:53,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {133739#(< 0 (mod (+ 7 main_~z~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; {133735#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:16:53,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {133743#(< 0 (mod (+ main_~z~0 8) 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; {133739#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:53,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {133747#(< 0 (mod (+ main_~z~0 9) 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; {133743#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:16:53,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {133751#(< 0 (mod (+ main_~z~0 10) 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; {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:16:53,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {133755#(< 0 (mod (+ main_~z~0 11) 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; {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:16:53,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} assume !(~z~0 % 4294967296 > 0); {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} is VALID [2022-04-28 10:16:53,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {133751#(< 0 (mod (+ main_~z~0 10) 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; {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} is VALID [2022-04-28 10:16:53,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {133747#(< 0 (mod (+ main_~z~0 9) 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; {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:16:53,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} ~z~0 := ~y~0; {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:16:53,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:53,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {133775#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:53,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {133779#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133775#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:53,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {133783#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133779#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:53,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {133787#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133783#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:16:53,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {133791#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133787#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:16:53,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {133795#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133791#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:16:53,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {133799#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133795#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:16:53,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {133803#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133799#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:16:53,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {133807#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133803#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:16:53,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {133811#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133807#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:16:53,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {133815#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133811#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:53,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133815#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:16:53,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-28 10:16:53,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-28 10:16:53,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-28 10:16:53,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#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); {133530#true} is VALID [2022-04-28 10:16:53,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133530#true} is VALID [2022-04-28 10:16:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:16:53,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276987530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:53,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:53,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26, 26] total 52 [2022-04-28 10:16:53,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29154745] [2022-04-28 10:16:53,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29154745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:53,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:53,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27437549] [2022-04-28 10:16:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:16:53,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:53,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:16:53,267 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 10:16:53,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2250, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:16:53,268 INFO L87 Difference]: Start difference. First operand 408 states and 522 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:17:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:02,212 INFO L93 Difference]: Finished difference Result 664 states and 832 transitions. [2022-04-28 10:17:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:17:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 42 [2022-04-28 10:17:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:17:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 146 transitions. [2022-04-28 10:17:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:17:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 146 transitions. [2022-04-28 10:17:02,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 146 transitions. [2022-04-28 10:17:02,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:02,336 INFO L225 Difference]: With dead ends: 664 [2022-04-28 10:17:02,336 INFO L226 Difference]: Without dead ends: 643 [2022-04-28 10:17:02,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=747, Invalid=4083, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:17:02,338 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:02,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 129 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:17:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-28 10:17:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 408. [2022-04-28 10:17:04,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:04,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 10:17:04,305 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 10:17:04,305 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 10:17:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:04,317 INFO L93 Difference]: Finished difference Result 643 states and 810 transitions. [2022-04-28 10:17:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 810 transitions. [2022-04-28 10:17:04,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:04,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:04,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 643 states. [2022-04-28 10:17:04,318 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 643 states. [2022-04-28 10:17:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:04,330 INFO L93 Difference]: Finished difference Result 643 states and 810 transitions. [2022-04-28 10:17:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 810 transitions. [2022-04-28 10:17:04,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:04,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:04,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:04,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 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 10:17:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 521 transitions. [2022-04-28 10:17:04,341 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 521 transitions. Word has length 42 [2022-04-28 10:17:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:04,341 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 521 transitions. [2022-04-28 10:17:04,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 10:17:04,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 521 transitions. [2022-04-28 10:17:07,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2022-04-28 10:17:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:07,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:07,326 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:07,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 10:17:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:07,526 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -303981326, now seen corresponding path program 75 times [2022-04-28 10:17:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652652914] [2022-04-28 10:17:07,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:07,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash -303981326, now seen corresponding path program 76 times [2022-04-28 10:17:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508033993] [2022-04-28 10:17:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:07,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {137333#(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); {137302#true} is VALID [2022-04-28 10:17:07,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-28 10:17:07,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-28 10:17:07,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:07,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {137333#(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); {137302#true} is VALID [2022-04-28 10:17:07,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-28 10:17:07,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-28 10:17:07,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-28 10:17:07,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137307#(= main_~y~0 0)} is VALID [2022-04-28 10:17:07,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {137307#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:07,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:07,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:07,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:07,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:07,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:07,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:07,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:07,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:07,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:07,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:07,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:07,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:07,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:07,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:07,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:07,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:07,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:07,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:07,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:07,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:07,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:07,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:07,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:07,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:17:07,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} 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; {137332#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:07,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {137332#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:07,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} 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; {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-28 10:17:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:17:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:07,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508033993] [2022-04-28 10:17:07,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508033993] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:07,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096568910] [2022-04-28 10:17:07,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:07,989 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:07,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-28 10:17:08,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:08,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:08,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:17:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:08,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:08,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137302#true} is VALID [2022-04-28 10:17:08,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#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); {137302#true} is VALID [2022-04-28 10:17:08,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-28 10:17:08,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-28 10:17:08,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-28 10:17:08,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137307#(= main_~y~0 0)} is VALID [2022-04-28 10:17:08,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {137307#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:08,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:08,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:08,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:08,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:08,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:08,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:08,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:08,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:08,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:08,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:08,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:08,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:08,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:08,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:08,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:08,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:08,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:08,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:08,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:08,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:08,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:08,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:08,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:08,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:17:08,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} 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; {137430#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:17:08,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {137430#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:08,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} 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; {137303#false} is VALID [2022-04-28 10:17:08,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:08,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-28 10:17:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:17:08,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:09,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} 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; {137303#false} is VALID [2022-04-28 10:17:09,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {137488#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-28 10:17:09,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {137492#(< 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; {137488#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:09,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {137492#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:09,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:09,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {137503#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:09,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {137507#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137503#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:09,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {137511#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137507#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:09,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {137515#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137511#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:09,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {137519#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137515#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:09,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {137523#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137519#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:09,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {137527#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137523#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:09,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {137531#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137527#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:09,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {137535#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137531#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:09,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {137539#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137535#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:09,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {137543#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137539#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:09,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {137547#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137543#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:09,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {137551#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137547#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:09,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {137555#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137551#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:09,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {137559#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137555#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:09,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {137563#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137559#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:09,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {137567#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137563#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:09,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {137571#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137567#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:17:09,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {137575#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137571#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:17:09,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {137579#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137575#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:17:09,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {137583#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137579#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:09,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {137587#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137583#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:17:09,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {137591#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137587#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:17:09,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137591#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:17:09,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-28 10:17:09,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-28 10:17:09,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-28 10:17:09,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#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); {137302#true} is VALID [2022-04-28 10:17:09,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137302#true} is VALID [2022-04-28 10:17:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:17:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096568910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:09,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:09,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:17:09,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652652914] [2022-04-28 10:17:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652652914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:09,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:09,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:17:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257310108] [2022-04-28 10:17:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:09,460 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 42 [2022-04-28 10:17:09,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:09,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 10:17:09,485 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 10:17:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:17:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:17:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=2389, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:17:09,486 INFO L87 Difference]: Start difference. First operand 408 states and 521 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 10:17:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:30,115 INFO L93 Difference]: Finished difference Result 949 states and 1331 transitions. [2022-04-28 10:17:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:17:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 42 [2022-04-28 10:17:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 10:17:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 298 transitions. [2022-04-28 10:17:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 10:17:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 298 transitions. [2022-04-28 10:17:30,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 298 transitions. [2022-04-28 10:17:30,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:30,376 INFO L225 Difference]: With dead ends: 949 [2022-04-28 10:17:30,377 INFO L226 Difference]: Without dead ends: 920 [2022-04-28 10:17:30,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1459, Invalid=5347, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 10:17:30,377 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 217 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6297 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 6297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:30,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 267 Invalid, 6456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 6297 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 10:17:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-04-28 10:17:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 424. [2022-04-28 10:17:32,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:32,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 10:17:32,445 INFO L74 IsIncluded]: Start isIncluded. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 10:17:32,445 INFO L87 Difference]: Start difference. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 10:17:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:32,470 INFO L93 Difference]: Finished difference Result 920 states and 1154 transitions. [2022-04-28 10:17:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1154 transitions. [2022-04-28 10:17:32,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:32,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:32,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 920 states. [2022-04-28 10:17:32,471 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 920 states. [2022-04-28 10:17:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:32,495 INFO L93 Difference]: Finished difference Result 920 states and 1154 transitions. [2022-04-28 10:17:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1154 transitions. [2022-04-28 10:17:32,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:32,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:32,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:32,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 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 10:17:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 544 transitions. [2022-04-28 10:17:32,504 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 544 transitions. Word has length 42 [2022-04-28 10:17:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:32,504 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 544 transitions. [2022-04-28 10:17:32,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 10:17:32,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 544 transitions. [2022-04-28 10:17:35,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 544 transitions. [2022-04-28 10:17:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:17:35,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:35,575 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:35,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:35,775 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash -837643569, now seen corresponding path program 39 times [2022-04-28 10:17:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:35,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767534745] [2022-04-28 10:17:35,778 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:35,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -837643569, now seen corresponding path program 40 times [2022-04-28 10:17:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:35,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903738054] [2022-04-28 10:17:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:36,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {142276#(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); {142252#true} is VALID [2022-04-28 10:17:36,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-28 10:17:36,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-28 10:17:36,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:36,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {142276#(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); {142252#true} is VALID [2022-04-28 10:17:36,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-28 10:17:36,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-28 10:17:36,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-28 10:17:36,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142257#(= main_~y~0 0)} is VALID [2022-04-28 10:17:36,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {142257#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142258#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:36,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {142258#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142259#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:36,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {142259#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142260#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:36,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {142260#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142261#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:36,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {142261#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142262#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:36,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {142262#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142263#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:36,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {142263#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142264#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:36,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {142264#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142265#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:36,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {142265#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:36,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:36,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {142267#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:36,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {142267#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {142268#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:36,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {142268#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {142269#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:36,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {142269#(and (<= main_~z~0 7) (<= 7 main_~z~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; {142270#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:36,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {142270#(and (<= main_~z~0 6) (<= 6 main_~z~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; {142271#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:17:36,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {142271#(and (<= main_~z~0 5) (<= 5 main_~z~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; {142272#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:17:36,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {142272#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {142273#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:17:36,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {142273#(and (<= main_~z~0 3) (<= 3 main_~z~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; {142274#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:17:36,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {142274#(and (<= main_~z~0 2) (<= 2 main_~z~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; {142275#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {142275#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {142253#false} 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; {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {142253#false} assume !(~y~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {142253#false} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-28 10:17:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:17:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903738054] [2022-04-28 10:17:36,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903738054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191142254] [2022-04-28 10:17:36,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:36,113 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-28 10:17:36,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:36,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:17:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:36,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:36,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142252#true} is VALID [2022-04-28 10:17:36,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#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); {142252#true} is VALID [2022-04-28 10:17:36,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-28 10:17:36,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-28 10:17:36,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-28 10:17:36,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142252#true} is VALID [2022-04-28 10:17:36,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142252#true} is VALID [2022-04-28 10:17:36,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:36,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:36,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:36,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:36,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:36,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 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; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {142325#(< 0 (mod (+ 7 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; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:36,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 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; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {142317#(< 0 (mod (+ 5 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; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:36,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 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; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:36,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 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; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:36,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 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; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:36,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-28 10:17:36,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,518 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-28 10:17:36,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-28 10:17:36,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-28 10:17:36,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-28 10:17:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:17:36,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:36,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-28 10:17:36,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {142360#(< 0 (mod main_~x~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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 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; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:36,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 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; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:36,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 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; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:36,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 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; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:36,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {142317#(< 0 (mod (+ 5 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; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:36,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 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; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {142325#(< 0 (mod (+ 7 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; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:36,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 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; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:36,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:36,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:36,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:36,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:36,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:36,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:36,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#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); {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142252#true} is VALID [2022-04-28 10:17:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:17:36,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191142254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:36,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-28 10:17:36,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767534745] [2022-04-28 10:17:36,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767534745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:36,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:17:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775800634] [2022-04-28 10:17:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:36,694 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 43 [2022-04-28 10:17:36,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:36,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:17:36,718 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 10:17:36,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:17:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:17:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:17:36,718 INFO L87 Difference]: Start difference. First operand 424 states and 544 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:17:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:45,221 INFO L93 Difference]: Finished difference Result 578 states and 745 transitions. [2022-04-28 10:17:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:17:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 43 [2022-04-28 10:17:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:17:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 145 transitions. [2022-04-28 10:17:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:17:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 145 transitions. [2022-04-28 10:17:45,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 145 transitions. [2022-04-28 10:17:45,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:45,348 INFO L225 Difference]: With dead ends: 578 [2022-04-28 10:17:45,348 INFO L226 Difference]: Without dead ends: 559 [2022-04-28 10:17:45,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=4631, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:17:45,348 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:45,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 116 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:17:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-28 10:17:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 425. [2022-04-28 10:17:47,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:47,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 10:17:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 10:17:47,427 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 10:17:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:47,436 INFO L93 Difference]: Finished difference Result 559 states and 723 transitions. [2022-04-28 10:17:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-04-28 10:17:47,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:47,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:47,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 559 states. [2022-04-28 10:17:47,437 INFO L87 Difference]: Start difference. First operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 559 states. [2022-04-28 10:17:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:47,447 INFO L93 Difference]: Finished difference Result 559 states and 723 transitions. [2022-04-28 10:17:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-04-28 10:17:47,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:47,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:47,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:47,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 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 10:17:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 545 transitions. [2022-04-28 10:17:47,455 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 545 transitions. Word has length 43 [2022-04-28 10:17:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:47,455 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 545 transitions. [2022-04-28 10:17:47,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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 10:17:47,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 545 transitions. [2022-04-28 10:17:50,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 545 transitions. [2022-04-28 10:17:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:17:50,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:50,708 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:50,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:50,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:50,923 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1349473345, now seen corresponding path program 77 times [2022-04-28 10:17:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826659539] [2022-04-28 10:17:50,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:50,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1349473345, now seen corresponding path program 78 times [2022-04-28 10:17:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:50,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381689110] [2022-04-28 10:17:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:51,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {145779#(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); {145747#true} is VALID [2022-04-28 10:17:51,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-28 10:17:51,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-28 10:17:51,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:51,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {145779#(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); {145747#true} is VALID [2022-04-28 10:17:51,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-28 10:17:51,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-28 10:17:51,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-28 10:17:51,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145752#(= main_~y~0 0)} is VALID [2022-04-28 10:17:51,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {145752#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:51,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {145753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:51,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {145754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:51,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {145755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:51,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {145756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:51,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {145757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:51,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {145758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:51,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {145759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:51,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {145760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:51,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {145761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145762#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:51,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {145762#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145763#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:51,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {145763#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145764#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:51,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {145764#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145765#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:51,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {145765#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145766#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:51,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {145766#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145767#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:51,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {145767#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145768#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:51,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {145768#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145769#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:51,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {145769#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145770#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:51,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {145770#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145771#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:51,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {145771#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145772#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:51,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {145772#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145773#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:51,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {145773#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145774#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:51,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {145774#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145775#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:51,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {145775#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:51,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:51,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {145777#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:17:51,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {145777#(and (<= main_~z~0 24) (<= 24 main_~z~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; {145778#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:17:51,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {145778#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {145748#false} 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; {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {145748#false} assume !(~y~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {145748#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {145748#false} assume !(~x~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {145748#false} assume !(~z~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L272 TraceCheckUtils]: 39: Hoare triple {145748#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {145748#false} ~cond := #in~cond; {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {145748#false} assume 0 == ~cond; {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-28 10:17:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:17:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381689110] [2022-04-28 10:17:51,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381689110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259069571] [2022-04-28 10:17:51,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:51,418 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-28 10:17:51,457 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:17:51,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:51,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:17:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:51,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:51,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#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); {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:51,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {145747#true} assume !(~x~0 % 4294967296 > 0); {145747#true} is VALID [2022-04-28 10:17:51,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {145747#true} ~z~0 := ~y~0; {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:17:51,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {145876#(= 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; {145880#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:17:51,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {145880#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {145880#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:17:51,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {145880#(= 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; {145887#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:17:51,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {145887#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {145887#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:17:51,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {145887#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:17:51,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {145876#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:17:51,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {145876#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {145900#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:17:51,783 INFO L272 TraceCheckUtils]: 39: Hoare triple {145900#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:17:51,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {145908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:17:51,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {145908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {145748#false} is VALID [2022-04-28 10:17:51,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-28 10:17:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-28 10:17:51,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:52,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-28 10:17:52,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {145908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {145748#false} is VALID [2022-04-28 10:17:52,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {145908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:17:52,061 INFO L272 TraceCheckUtils]: 39: Hoare triple {145900#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:17:52,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {145900#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:17:52,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:17:52,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:17:52,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:17:52,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:17:52,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {145747#true} ~z~0 := ~y~0; {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {145747#true} assume !(~x~0 % 4294967296 > 0); {145747#true} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-28 10:17:52,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-28 10:17:52,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-28 10:17:52,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#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); {145747#true} is VALID [2022-04-28 10:17:52,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145747#true} is VALID [2022-04-28 10:17:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-28 10:17:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259069571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:52,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:52,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 8, 8] total 39 [2022-04-28 10:17:52,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826659539] [2022-04-28 10:17:52,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826659539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:52,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:52,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:17:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412481653] [2022-04-28 10:17:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:52,070 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 43 [2022-04-28 10:17:52,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:52,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 10:17:52,106 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 10:17:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:17:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:17:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:17:52,107 INFO L87 Difference]: Start difference. First operand 425 states and 545 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 10:18:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:14,386 INFO L93 Difference]: Finished difference Result 987 states and 1387 transitions. [2022-04-28 10:18:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:18:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 43 [2022-04-28 10:18:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 10:18:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 310 transitions. [2022-04-28 10:18:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 10:18:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 310 transitions. [2022-04-28 10:18:14,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 310 transitions. [2022-04-28 10:18:14,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:14,683 INFO L225 Difference]: With dead ends: 987 [2022-04-28 10:18:14,683 INFO L226 Difference]: Without dead ends: 958 [2022-04-28 10:18:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=4202, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:18:14,684 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 228 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6835 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 6835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:14,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 278 Invalid, 7001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 6835 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 10:18:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-04-28 10:18:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 441. [2022-04-28 10:18:16,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:16,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 10:18:16,848 INFO L74 IsIncluded]: Start isIncluded. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 10:18:16,848 INFO L87 Difference]: Start difference. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 10:18:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:16,875 INFO L93 Difference]: Finished difference Result 958 states and 1204 transitions. [2022-04-28 10:18:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1204 transitions. [2022-04-28 10:18:16,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:16,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:16,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 958 states. [2022-04-28 10:18:16,876 INFO L87 Difference]: Start difference. First operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 958 states. [2022-04-28 10:18:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:16,901 INFO L93 Difference]: Finished difference Result 958 states and 1204 transitions. [2022-04-28 10:18:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1204 transitions. [2022-04-28 10:18:16,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:16,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:16,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:16,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 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 10:18:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 568 transitions. [2022-04-28 10:18:16,910 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 568 transitions. Word has length 43 [2022-04-28 10:18:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:16,910 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 568 transitions. [2022-04-28 10:18:16,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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 10:18:16,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 568 transitions. [2022-04-28 10:18:21,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 567 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 568 transitions. [2022-04-28 10:18:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:18:21,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:21,991 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:22,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:22,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-04-28 10:18:22,191 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -733099069, now seen corresponding path program 41 times [2022-04-28 10:18:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102090110] [2022-04-28 10:18:22,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:22,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash -733099069, now seen corresponding path program 42 times [2022-04-28 10:18:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:22,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384358018] [2022-04-28 10:18:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:22,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:22,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {150893#(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); {150874#true} is VALID [2022-04-28 10:18:22,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-28 10:18:22,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-28 10:18:22,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:22,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {150893#(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); {150874#true} is VALID [2022-04-28 10:18:22,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-28 10:18:22,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-28 10:18:22,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-28 10:18:22,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-28 10:18:22,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150880#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:18:22,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {150880#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150881#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {150881#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150882#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {150882#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150883#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {150883#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150884#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {150884#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:18:22,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:18:22,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:18:22,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 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; {150886#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:18:22,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {150886#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 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; {150887#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:18:22,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {150887#(<= (+ 2 (* (div (+ 5 main_~x~0) 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; {150888#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-28 10:18:22,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {150888#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) 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; {150889#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-28 10:18:22,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {150889#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) 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; {150890#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:18:22,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {150890#(<= (+ 5 (* (div (+ main_~x~0 2) 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; {150891#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:18:22,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {150891#(<= (+ 6 (* (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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) 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; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:18:22,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:22,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-28 10:18:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:18:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384358018] [2022-04-28 10:18:22,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384358018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:22,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291287719] [2022-04-28 10:18:22,437 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:22,438 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-28 10:18:22,557 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:18:22,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:22,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:18:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:22,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:22,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150874#true} is VALID [2022-04-28 10:18:22,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#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); {150874#true} is VALID [2022-04-28 10:18:22,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-28 10:18:22,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-28 10:18:22,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-28 10:18:22,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-28 10:18:22,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:18:22,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:18:22,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:18:22,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:22,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:22,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:22,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 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; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:18:22,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} 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; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:18:22,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:18:22,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:22,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:22,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:22,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-28 10:18:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:18:22,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-28 10:18:23,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-28 10:18:23,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 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; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} 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; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:23,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:18:23,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} 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; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 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; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:18:23,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} 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; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 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; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:18:23,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:23,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:23,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:18:23,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:18:23,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:18:23,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:18:23,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:18:23,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:18:23,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#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); {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150874#true} is VALID [2022-04-28 10:18:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:18:23,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291287719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:23,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:23,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-28 10:18:23,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:23,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102090110] [2022-04-28 10:18:23,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102090110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:23,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:23,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:18:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931151576] [2022-04-28 10:18:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 44 [2022-04-28 10:18:23,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:23,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 10:18:23,252 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 10:18:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:18:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:18:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:18:23,252 INFO L87 Difference]: Start difference. First operand 441 states and 568 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 10:18:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:27,475 INFO L93 Difference]: Finished difference Result 526 states and 697 transitions. [2022-04-28 10:18:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:18:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 44 [2022-04-28 10:18:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 10:18:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-28 10:18:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 10:18:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-28 10:18:27,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 92 transitions. [2022-04-28 10:18:27,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:27,574 INFO L225 Difference]: With dead ends: 526 [2022-04-28 10:18:27,574 INFO L226 Difference]: Without dead ends: 511 [2022-04-28 10:18:27,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:18:27,574 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:27,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 62 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:18:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-28 10:18:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 492. [2022-04-28 10:18:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:30,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 10:18:30,231 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 10:18:30,231 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 10:18:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:30,239 INFO L93 Difference]: Finished difference Result 511 states and 668 transitions. [2022-04-28 10:18:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 668 transitions. [2022-04-28 10:18:30,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:30,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:30,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 511 states. [2022-04-28 10:18:30,240 INFO L87 Difference]: Start difference. First operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 511 states. [2022-04-28 10:18:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:30,248 INFO L93 Difference]: Finished difference Result 511 states and 668 transitions. [2022-04-28 10:18:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 668 transitions. [2022-04-28 10:18:30,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:30,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:30,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:30,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 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 10:18:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 636 transitions. [2022-04-28 10:18:30,259 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 636 transitions. Word has length 44 [2022-04-28 10:18:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:30,259 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 636 transitions. [2022-04-28 10:18:30,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 10:18:30,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 492 states and 636 transitions. [2022-04-28 10:18:34,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 636 transitions. [2022-04-28 10:18:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:18:34,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:34,363 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:34,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:34,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:34,563 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1738188893, now seen corresponding path program 43 times [2022-04-28 10:18:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255706428] [2022-04-28 10:18:34,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:34,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1738188893, now seen corresponding path program 44 times [2022-04-28 10:18:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:34,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721023569] [2022-04-28 10:18:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:34,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {154276#(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); {154250#true} is VALID [2022-04-28 10:18:34,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-28 10:18:34,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-28 10:18:34,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:34,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {154276#(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); {154250#true} is VALID [2022-04-28 10:18:34,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-28 10:18:34,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-28 10:18:34,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-28 10:18:34,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154255#(= main_~y~0 0)} is VALID [2022-04-28 10:18:34,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {154255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:34,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {154256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:34,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {154257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:34,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {154258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:34,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {154259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:34,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {154260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:34,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {154261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:34,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {154262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:34,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {154263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:34,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:34,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:34,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:34,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:34,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {154267#(and (<= main_~z~0 7) (<= 7 main_~z~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; {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:34,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {154268#(and (<= main_~z~0 6) (<= 6 main_~z~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; {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:34,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {154269#(and (<= main_~z~0 5) (<= 5 main_~z~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; {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:34,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} 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; {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:18:34,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {154271#(and (<= main_~z~0 3) (<= 3 main_~z~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; {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:18:34,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {154272#(and (<= main_~z~0 2) (<= 2 main_~z~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; {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:18:34,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {154273#(and (<= main_~z~0 1) (<= 1 main_~z~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; {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:18:34,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:18:34,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {154274#(and (<= main_~z~0 0) (<= 0 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; {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:18:34,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {154273#(and (<= main_~z~0 1) (<= 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; {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:18:34,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {154272#(and (<= main_~z~0 2) (<= 2 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; {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:18:34,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {154271#(and (<= main_~z~0 3) (<= 3 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; {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:34,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {154270#(and (<= 4 main_~z~0) (<= main_~z~0 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; {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:34,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {154269#(and (<= main_~z~0 5) (<= 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; {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:34,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {154268#(and (<= main_~z~0 6) (<= 6 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; {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:34,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {154267#(and (<= main_~z~0 7) (<= 7 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; {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:34,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:34,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~y~0 % 4294967296 > 0); {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:34,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~x~0 % 4294967296 > 0); {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:34,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154275#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:34,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {154275#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-28 10:18:34,930 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-28 10:18:34,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-28 10:18:34,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-28 10:18:34,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-28 10:18:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721023569] [2022-04-28 10:18:34,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721023569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369139308] [2022-04-28 10:18:34,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:18:34,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:34,931 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:34,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-28 10:18:34,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:18:34,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:34,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:18:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:35,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#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); {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154250#true} is VALID [2022-04-28 10:18:35,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {154250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:35,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:35,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:35,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:35,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:35,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:18:35,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 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; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:18:35,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 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; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {154322#(< 0 (mod (+ 7 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; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:35,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 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; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {154314#(< 0 (mod (+ 5 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; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:35,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 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; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:35,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 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; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:35,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 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; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:35,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {154251#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {154251#false} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-28 10:18:35,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-28 10:18:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:18:35,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {154251#false} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {154251#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154251#false} is VALID [2022-04-28 10:18:35,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-28 10:18:35,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {154364#(< 0 (mod main_~x~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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 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; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:35,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 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; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:35,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 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; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:35,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 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; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:35,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {154314#(< 0 (mod (+ 5 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; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:35,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 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; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {154322#(< 0 (mod (+ 7 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; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:35,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 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; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 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; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:18:35,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:18:35,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:18:35,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:35,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:35,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:35,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:35,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:35,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {154250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:35,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154250#true} is VALID [2022-04-28 10:18:35,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-28 10:18:35,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-28 10:18:35,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-28 10:18:35,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#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); {154250#true} is VALID [2022-04-28 10:18:35,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154250#true} is VALID [2022-04-28 10:18:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:18:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369139308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:35,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:35,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 12] total 34 [2022-04-28 10:18:35,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:35,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255706428] [2022-04-28 10:18:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255706428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:35,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:35,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:18:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817787892] [2022-04-28 10:18:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:35,536 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 44 [2022-04-28 10:18:35,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:35,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 10:18:35,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:35,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:18:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:18:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:18:35,566 INFO L87 Difference]: Start difference. First operand 492 states and 636 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 10:18:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:52,407 INFO L93 Difference]: Finished difference Result 689 states and 928 transitions. [2022-04-28 10:18:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-04-28 10:18:52,407 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 44 [2022-04-28 10:18:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 10:18:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 353 transitions. [2022-04-28 10:18:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 10:18:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 353 transitions. [2022-04-28 10:18:52,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 353 transitions. [2022-04-28 10:18:52,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:52,714 INFO L225 Difference]: With dead ends: 689 [2022-04-28 10:18:52,714 INFO L226 Difference]: Without dead ends: 669 [2022-04-28 10:18:52,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6802 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=855, Invalid=22097, Unknown=0, NotChecked=0, Total=22952 [2022-04-28 10:18:52,719 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:52,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 148 Invalid, 4964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 10:18:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-04-28 10:18:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 504. [2022-04-28 10:18:55,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:55,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 10:18:55,552 INFO L74 IsIncluded]: Start isIncluded. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 10:18:55,553 INFO L87 Difference]: Start difference. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 10:18:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:55,566 INFO L93 Difference]: Finished difference Result 669 states and 840 transitions. [2022-04-28 10:18:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 840 transitions. [2022-04-28 10:18:55,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:55,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:55,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 669 states. [2022-04-28 10:18:55,567 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 669 states. [2022-04-28 10:18:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:55,580 INFO L93 Difference]: Finished difference Result 669 states and 840 transitions. [2022-04-28 10:18:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 840 transitions. [2022-04-28 10:18:55,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:55,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:55,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:55,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 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 10:18:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 648 transitions. [2022-04-28 10:18:55,591 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 648 transitions. Word has length 44 [2022-04-28 10:18:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:55,591 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 648 transitions. [2022-04-28 10:18:55,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 10:18:55,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 648 transitions. [2022-04-28 10:19:00,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 648 transitions. [2022-04-28 10:19:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:19:00,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:00,490 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:00,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-04-28 10:19:00,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:00,691 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash -740863102, now seen corresponding path program 79 times [2022-04-28 10:19:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:00,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345814621] [2022-04-28 10:19:00,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:00,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash -740863102, now seen corresponding path program 80 times [2022-04-28 10:19:00,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:00,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074121678] [2022-04-28 10:19:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:00,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {158531#(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); {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:00,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {158531#(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); {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-28 10:19:00,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-28 10:19:00,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158515#(= main_~y~0 0)} is VALID [2022-04-28 10:19:00,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {158515#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:00,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:00,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:00,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:00,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:00,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:00,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:00,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:00,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:00,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:00,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:00,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:00,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 main_~z~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; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:00,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:00,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:19:00,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 main_~z~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; {158530#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {158530#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {158511#false} 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; {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {158511#false} assume !(~y~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:00,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {158511#false} assume !(~x~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {158511#false} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-28 10:19:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-28 10:19:00,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074121678] [2022-04-28 10:19:00,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074121678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315785310] [2022-04-28 10:19:00,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:00,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:00,949 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:00,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-28 10:19:00,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:00,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:00,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:19:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:01,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:01,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158510#true} is VALID [2022-04-28 10:19:01,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#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); {158510#true} is VALID [2022-04-28 10:19:01,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-28 10:19:01,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-28 10:19:01,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-28 10:19:01,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158515#(= main_~y~0 0)} is VALID [2022-04-28 10:19:01,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {158515#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:01,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:01,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:01,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:01,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:01,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:01,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:01,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:01,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:01,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:01,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:01,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:01,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 main_~z~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; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:01,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:01,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:19:01,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 main_~z~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; {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:19:01,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:19:01,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {158598#(and (<= main_~z~0 6) (<= 6 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; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:19:01,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 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; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:01,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} 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; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:01,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:01,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 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; {158617#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:01,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {158617#(and (<= main_~z~0 11) (<= 11 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; {158621#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:01,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {158621#(and (<= main_~z~0 12) (<= 12 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; {158625#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:19:01,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {158625#(and (<= 13 main_~z~0) (<= main_~z~0 13))} 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; {158629#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:19:01,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {158629#(and (<= 14 main_~z~0) (<= main_~z~0 14))} 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; {158633#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:19:01,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {158633#(and (<= main_~z~0 15) (<= 15 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; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:19:01,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:01,477 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-28 10:19:01,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-28 10:19:01,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-28 10:19:01,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-28 10:19:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:19:01,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:02,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-28 10:19:02,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-28 10:19:02,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-28 10:19:02,187 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-28 10:19:02,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-28 10:19:02,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {158705#(< 0 (mod (+ main_~z~0 1) 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; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:02,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {158709#(< 0 (mod (+ main_~z~0 2) 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; {158705#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:19:02,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {158713#(< 0 (mod (+ main_~z~0 3) 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; {158709#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:19:02,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {158717#(< 0 (mod (+ main_~z~0 4) 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; {158713#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:19:02,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {158721#(< 0 (mod (+ 5 main_~z~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; {158717#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:19:02,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {158725#(< 0 (mod (+ main_~z~0 6) 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; {158721#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:19:02,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {158729#(< 0 (mod (+ 7 main_~z~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; {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:19:02,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {158733#(< 0 (mod (+ main_~z~0 8) 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; {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:19:02,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {158737#(< 0 (mod (+ main_~z~0 9) 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; {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:19:02,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {158741#(< 0 (mod (+ main_~z~0 10) 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; {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:19:02,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !(~z~0 % 4294967296 > 0); {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:19:02,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {158737#(< 0 (mod (+ main_~z~0 9) 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; {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:19:02,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {158733#(< 0 (mod (+ main_~z~0 8) 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; {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:19:02,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {158729#(< 0 (mod (+ 7 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; {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:19:02,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {158725#(< 0 (mod (+ main_~z~0 6) 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; {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:19:02,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:19:02,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:02,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {158767#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:02,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {158771#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158767#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:02,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {158775#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158771#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:02,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {158779#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158775#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:02,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {158783#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158779#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:02,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {158787#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158783#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:19:02,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {158791#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158787#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:19:02,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {158795#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158791#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:19:02,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {158799#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158795#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:19:02,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {158803#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158799#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:19:02,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158803#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:19:02,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-28 10:19:02,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-28 10:19:02,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-28 10:19:02,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#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); {158510#true} is VALID [2022-04-28 10:19:02,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158510#true} is VALID [2022-04-28 10:19:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:19:02,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315785310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:02,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:02,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 24] total 48 [2022-04-28 10:19:02,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:02,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345814621] [2022-04-28 10:19:02,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345814621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:02,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:02,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402362932] [2022-04-28 10:19:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:02,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:02,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:02,226 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 10:19:02,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:19:02,227 INFO L87 Difference]: Start difference. First operand 504 states and 648 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:12,892 INFO L93 Difference]: Finished difference Result 743 states and 940 transitions. [2022-04-28 10:19:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:19:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2022-04-28 10:19:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2022-04-28 10:19:12,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 144 transitions. [2022-04-28 10:19:12,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:13,026 INFO L225 Difference]: With dead ends: 743 [2022-04-28 10:19:13,026 INFO L226 Difference]: Without dead ends: 721 [2022-04-28 10:19:13,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=902, Invalid=4500, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:19:13,027 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:13,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 126 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:19:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-04-28 10:19:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 504. [2022-04-28 10:19:15,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:15,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 10:19:15,856 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 10:19:15,856 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 10:19:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:15,870 INFO L93 Difference]: Finished difference Result 721 states and 917 transitions. [2022-04-28 10:19:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2022-04-28 10:19:15,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:15,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:15,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 721 states. [2022-04-28 10:19:15,871 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 721 states. [2022-04-28 10:19:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:15,885 INFO L93 Difference]: Finished difference Result 721 states and 917 transitions. [2022-04-28 10:19:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2022-04-28 10:19:15,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:15,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:15,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:15,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 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 10:19:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 647 transitions. [2022-04-28 10:19:15,896 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 647 transitions. Word has length 44 [2022-04-28 10:19:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:15,896 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 647 transitions. [2022-04-28 10:19:15,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:15,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 647 transitions. [2022-04-28 10:19:20,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 647 transitions. [2022-04-28 10:19:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:19:20,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:20,438 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:20,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-04-28 10:19:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-04-28 10:19:20,651 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 251508882, now seen corresponding path program 81 times [2022-04-28 10:19:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:20,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1770010245] [2022-04-28 10:19:20,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:20,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash 251508882, now seen corresponding path program 82 times [2022-04-28 10:19:20,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:20,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442339344] [2022-04-28 10:19:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:20,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {162833#(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); {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:20,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {162833#(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); {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-28 10:19:20,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-28 10:19:20,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {162817#(= main_~y~0 0)} is VALID [2022-04-28 10:19:20,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {162817#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:20,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:20,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:20,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:20,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:20,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:20,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:20,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:20,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:20,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:20,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:20,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:20,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:20,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {162829#(and (<= main_~z~0 11) (<= 11 main_~z~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; {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:20,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {162830#(and (<= main_~z~0 10) (<= 10 main_~z~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; {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:20,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {162832#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {162832#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-28 10:19:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:20,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442339344] [2022-04-28 10:19:20,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442339344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:20,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891037105] [2022-04-28 10:19:20,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:19:20,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:20,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:20,924 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:20,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-28 10:19:20,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:19:20,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:19:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:20,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:21,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162812#true} is VALID [2022-04-28 10:19:21,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#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); {162812#true} is VALID [2022-04-28 10:19:21,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-28 10:19:21,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-28 10:19:21,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-28 10:19:21,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {162817#(= main_~y~0 0)} is VALID [2022-04-28 10:19:21,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {162817#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:21,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:21,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:21,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:21,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:21,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:21,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:21,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:21,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:21,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:21,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:21,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:21,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:21,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {162829#(and (<= main_~z~0 11) (<= 11 main_~z~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; {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:21,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {162830#(and (<= main_~z~0 10) (<= 10 main_~z~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; {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:21,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} 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; {162900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {162900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-28 10:19:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:21,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-28 10:19:21,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} 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; {162813#false} is VALID [2022-04-28 10:19:21,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {163030#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-28 10:19:21,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {163034#(< 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; {163030#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:21,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {163038#(< 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; {163034#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:21,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {163042#(< 0 (mod (+ main_~z~0 4294967293) 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; {163038#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:21,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {163042#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:21,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:21,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {163053#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:21,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {163057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163053#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:21,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {163061#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:21,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {163065#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163061#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:21,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {163069#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:21,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {163073#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:21,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {163077#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:21,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {163081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:21,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {163085#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:21,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {163089#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163085#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:21,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {163093#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163089#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:21,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163093#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:21,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-28 10:19:21,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-28 10:19:21,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-28 10:19:21,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#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); {162812#true} is VALID [2022-04-28 10:19:21,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162812#true} is VALID [2022-04-28 10:19:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:21,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891037105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:21,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:21,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:19:21,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1770010245] [2022-04-28 10:19:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1770010245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:21,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70292951] [2022-04-28 10:19:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:21,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:21,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:21,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:21,726 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 10:19:21,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:21,726 INFO L87 Difference]: Start difference. First operand 504 states and 647 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:32,930 INFO L93 Difference]: Finished difference Result 781 states and 983 transitions. [2022-04-28 10:19:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:19:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 150 transitions. [2022-04-28 10:19:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 150 transitions. [2022-04-28 10:19:32,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 150 transitions. [2022-04-28 10:19:33,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:33,066 INFO L225 Difference]: With dead ends: 781 [2022-04-28 10:19:33,066 INFO L226 Difference]: Without dead ends: 759 [2022-04-28 10:19:33,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=653, Invalid=2653, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:19:33,067 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 92 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:33,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 133 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:19:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-04-28 10:19:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 504. [2022-04-28 10:19:35,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:35,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 759 states. Second operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 10:19:35,919 INFO L74 IsIncluded]: Start isIncluded. First operand 759 states. Second operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 10:19:35,919 INFO L87 Difference]: Start difference. First operand 759 states. Second operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 10:19:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:35,939 INFO L93 Difference]: Finished difference Result 759 states and 960 transitions. [2022-04-28 10:19:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 960 transitions. [2022-04-28 10:19:35,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:35,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:35,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 759 states. [2022-04-28 10:19:35,940 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 759 states. [2022-04-28 10:19:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:35,957 INFO L93 Difference]: Finished difference Result 759 states and 960 transitions. [2022-04-28 10:19:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 960 transitions. [2022-04-28 10:19:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:35,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:35,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:35,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2865731462925851) internal successors, (642), 499 states have internal predecessors, (642), 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 10:19:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 646 transitions. [2022-04-28 10:19:35,969 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 646 transitions. Word has length 44 [2022-04-28 10:19:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:35,969 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 646 transitions. [2022-04-28 10:19:35,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:35,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 646 transitions. [2022-04-28 10:19:40,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 646 transitions. [2022-04-28 10:19:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:19:40,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:40,549 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:40,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:40,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:40,749 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 837710210, now seen corresponding path program 83 times [2022-04-28 10:19:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:40,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106505189] [2022-04-28 10:19:40,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:40,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:40,752 INFO L85 PathProgramCache]: Analyzing trace with hash 837710210, now seen corresponding path program 84 times [2022-04-28 10:19:40,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:40,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778912338] [2022-04-28 10:19:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:40,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:41,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:41,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {167267#(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); {167246#true} is VALID [2022-04-28 10:19:41,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {167246#true} assume true; {167246#true} is VALID [2022-04-28 10:19:41,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {167246#true} {167246#true} #83#return; {167246#true} is VALID [2022-04-28 10:19:41,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {167246#true} call ULTIMATE.init(); {167267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:41,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {167267#(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); {167246#true} is VALID [2022-04-28 10:19:41,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {167246#true} assume true; {167246#true} is VALID [2022-04-28 10:19:41,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {167246#true} {167246#true} #83#return; {167246#true} is VALID [2022-04-28 10:19:41,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {167246#true} call #t~ret15 := main(); {167246#true} is VALID [2022-04-28 10:19:41,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {167246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {167251#(= main_~y~0 0)} is VALID [2022-04-28 10:19:41,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {167251#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:41,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {167252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:41,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {167253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:41,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {167254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:41,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {167255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:41,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {167256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:41,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {167257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:41,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {167258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:41,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {167259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:41,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {167260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:41,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {167261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:41,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {167262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:41,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:41,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {167264#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:41,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {167264#(and (<= main_~z~0 12) (<= 12 main_~z~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; {167265#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {167265#(and (<= main_~z~0 11) (<= 11 main_~z~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; {167266#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {167266#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {167247#false} assume !(~y~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {167247#false} assume !(~x~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {167247#false} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L272 TraceCheckUtils]: 40: Hoare triple {167247#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {167247#false} ~cond := #in~cond; {167247#false} is VALID [2022-04-28 10:19:41,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {167247#false} assume 0 == ~cond; {167247#false} is VALID [2022-04-28 10:19:41,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {167247#false} assume !false; {167247#false} is VALID [2022-04-28 10:19:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:41,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:41,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778912338] [2022-04-28 10:19:41,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778912338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:41,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326667697] [2022-04-28 10:19:41,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:19:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:41,040 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:41,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-28 10:19:41,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:19:41,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:41,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:19:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:41,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {167246#true} call ULTIMATE.init(); {167246#true} is VALID [2022-04-28 10:19:41,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {167246#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); {167246#true} is VALID [2022-04-28 10:19:41,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {167246#true} assume true; {167246#true} is VALID [2022-04-28 10:19:41,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {167246#true} {167246#true} #83#return; {167246#true} is VALID [2022-04-28 10:19:41,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {167246#true} call #t~ret15 := main(); {167246#true} is VALID [2022-04-28 10:19:41,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {167246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {167251#(= main_~y~0 0)} is VALID [2022-04-28 10:19:41,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {167251#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:41,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {167252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:41,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {167253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:41,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {167254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:41,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {167255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:41,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {167256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:41,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {167257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:41,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {167258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:41,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {167259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:41,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {167260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:41,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {167261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:41,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {167262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:41,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:41,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {167263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {167264#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:41,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {167264#(and (<= main_~z~0 12) (<= 12 main_~z~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; {167265#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:41,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {167265#(and (<= main_~z~0 11) (<= 11 main_~z~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; {167334#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {167334#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {167247#false} assume !(~y~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {167247#false} assume !(~x~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {167247#false} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L272 TraceCheckUtils]: 40: Hoare triple {167247#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {167247#false} ~cond := #in~cond; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {167247#false} assume 0 == ~cond; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {167247#false} assume !false; {167247#false} is VALID [2022-04-28 10:19:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:41,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {167247#false} assume !false; {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {167247#false} assume 0 == ~cond; {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {167247#false} ~cond := #in~cond; {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L272 TraceCheckUtils]: 40: Hoare triple {167247#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {167247#false} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {167247#false} assume !(~x~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {167247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {167247#false} is VALID [2022-04-28 10:19:42,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {167247#false} assume !(~y~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {167247#false} 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; {167247#false} is VALID [2022-04-28 10:19:42,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {167464#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {167247#false} is VALID [2022-04-28 10:19:42,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {167468#(< 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; {167464#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {167472#(< 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; {167468#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:42,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {167476#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {167472#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:42,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {167476#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {167476#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:42,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {167483#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167476#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:42,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {167487#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167483#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:42,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {167491#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167487#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:42,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {167495#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167491#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:42,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {167499#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167495#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:42,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {167503#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167499#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:42,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {167507#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167503#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:42,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {167511#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167507#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:42,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {167515#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167511#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:42,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {167519#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167515#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:42,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {167523#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167519#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:42,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {167527#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {167523#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:42,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {167246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {167527#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:42,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {167246#true} call #t~ret15 := main(); {167246#true} is VALID [2022-04-28 10:19:42,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {167246#true} {167246#true} #83#return; {167246#true} is VALID [2022-04-28 10:19:42,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {167246#true} assume true; {167246#true} is VALID [2022-04-28 10:19:42,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {167246#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); {167246#true} is VALID [2022-04-28 10:19:42,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {167246#true} call ULTIMATE.init(); {167246#true} is VALID [2022-04-28 10:19:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:42,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326667697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:42,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:42,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:19:42,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:42,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106505189] [2022-04-28 10:19:42,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106505189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:42,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:42,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739331917] [2022-04-28 10:19:42,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:42,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:42,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:42,181 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 10:19:42,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:42,181 INFO L87 Difference]: Start difference. First operand 504 states and 646 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:54,970 INFO L93 Difference]: Finished difference Result 820 states and 1027 transitions. [2022-04-28 10:19:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:19:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 44 [2022-04-28 10:19:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-28 10:19:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-28 10:19:54,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 157 transitions. [2022-04-28 10:19:55,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:55,127 INFO L225 Difference]: With dead ends: 820 [2022-04-28 10:19:55,127 INFO L226 Difference]: Without dead ends: 798 [2022-04-28 10:19:55,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:19:55,128 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 105 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:55,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 145 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:19:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-04-28 10:19:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 504. [2022-04-28 10:19:58,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:58,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 798 states. Second operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 10:19:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand 798 states. Second operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 10:19:58,016 INFO L87 Difference]: Start difference. First operand 798 states. Second operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 10:19:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:58,037 INFO L93 Difference]: Finished difference Result 798 states and 1004 transitions. [2022-04-28 10:19:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1004 transitions. [2022-04-28 10:19:58,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:58,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:58,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 798 states. [2022-04-28 10:19:58,038 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 798 states. [2022-04-28 10:19:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:58,064 INFO L93 Difference]: Finished difference Result 798 states and 1004 transitions. [2022-04-28 10:19:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1004 transitions. [2022-04-28 10:19:58,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:58,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:58,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:58,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 499 states have internal predecessors, (641), 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 10:19:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 645 transitions. [2022-04-28 10:19:58,081 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 645 transitions. Word has length 44 [2022-04-28 10:19:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:58,081 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 645 transitions. [2022-04-28 10:19:58,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 10:19:58,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 645 transitions. [2022-04-28 10:20:03,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 645 edges. 645 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 645 transitions. [2022-04-28 10:20:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:20:03,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:03,210 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:03,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-04-28 10:20:03,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:03,411 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash 600012434, now seen corresponding path program 85 times [2022-04-28 10:20:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:03,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936880966] [2022-04-28 10:20:03,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:03,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash 600012434, now seen corresponding path program 86 times [2022-04-28 10:20:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:03,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276809586] [2022-04-28 10:20:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:03,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {171863#(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); {171830#true} is VALID [2022-04-28 10:20:03,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {171830#true} assume true; {171830#true} is VALID [2022-04-28 10:20:03,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171830#true} {171830#true} #83#return; {171830#true} is VALID [2022-04-28 10:20:03,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {171830#true} call ULTIMATE.init(); {171863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:03,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {171863#(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); {171830#true} is VALID [2022-04-28 10:20:03,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {171830#true} assume true; {171830#true} is VALID [2022-04-28 10:20:03,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171830#true} {171830#true} #83#return; {171830#true} is VALID [2022-04-28 10:20:03,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {171830#true} call #t~ret15 := main(); {171830#true} is VALID [2022-04-28 10:20:03,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {171830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {171835#(= main_~y~0 0)} is VALID [2022-04-28 10:20:03,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {171835#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:20:03,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {171836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:20:03,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {171837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:20:03,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {171838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:20:03,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {171839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:20:03,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {171840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:20:03,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {171841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:20:03,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {171842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:20:03,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {171843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:20:03,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {171844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:20:03,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {171845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:20:03,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {171846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:20:03,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {171847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:20:03,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {171848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:20:03,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {171849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:20:03,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {171850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:20:03,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {171851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:20:03,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {171852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:20:03,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {171853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:20:03,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {171854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:20:03,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {171855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171856#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:20:03,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {171856#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171857#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:20:03,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {171857#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171858#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:20:03,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {171858#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171859#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:20:03,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {171859#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:20:03,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:20:03,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {171861#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:20:03,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {171861#(and (<= 25 main_~z~0) (<= main_~z~0 25))} 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; {171862#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {171862#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {171831#false} 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; {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {171831#false} assume !(~y~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {171831#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {171831#false} assume !(~x~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {171831#false} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L272 TraceCheckUtils]: 40: Hoare triple {171831#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {171831#false} ~cond := #in~cond; {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {171831#false} assume 0 == ~cond; {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {171831#false} assume !false; {171831#false} is VALID [2022-04-28 10:20:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:20:03,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276809586] [2022-04-28 10:20:03,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276809586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888365983] [2022-04-28 10:20:03,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:20:03,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:03,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:03,961 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:03,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-28 10:20:04,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:20:04,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:04,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 10:20:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:04,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:04,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {171830#true} call ULTIMATE.init(); {171830#true} is VALID [2022-04-28 10:20:04,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {171830#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); {171830#true} is VALID [2022-04-28 10:20:04,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {171830#true} assume true; {171830#true} is VALID [2022-04-28 10:20:04,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171830#true} {171830#true} #83#return; {171830#true} is VALID [2022-04-28 10:20:04,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {171830#true} call #t~ret15 := main(); {171830#true} is VALID [2022-04-28 10:20:04,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {171830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {171835#(= main_~y~0 0)} is VALID [2022-04-28 10:20:04,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {171835#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:20:04,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {171836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:20:04,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {171837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:20:04,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {171838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:20:04,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {171839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:20:04,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {171840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:20:04,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {171841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:20:04,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {171842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:20:04,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {171843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:20:04,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {171844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:20:04,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {171845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:20:04,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {171846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:20:04,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {171847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:20:04,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {171848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:20:04,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {171849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:20:04,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {171850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:20:04,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {171851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:20:04,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {171852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:20:04,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {171853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:20:04,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {171854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:20:04,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {171855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171856#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:20:04,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {171856#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171857#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:20:04,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {171857#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171858#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:20:04,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {171858#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171859#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:20:04,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {171859#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:20:04,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:20:04,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {171860#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {171861#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:20:04,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {171861#(and (<= 25 main_~z~0) (<= main_~z~0 25))} 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; {171966#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:20:04,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {171966#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {171831#false} 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; {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {171831#false} assume !(~y~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {171831#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {171831#false} assume !(~x~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {171831#false} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L272 TraceCheckUtils]: 40: Hoare triple {171831#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {171831#false} ~cond := #in~cond; {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {171831#false} assume 0 == ~cond; {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {171831#false} assume !false; {171831#false} is VALID [2022-04-28 10:20:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:20:04,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {171831#false} assume !false; {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {171831#false} assume 0 == ~cond; {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {171831#false} ~cond := #in~cond; {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L272 TraceCheckUtils]: 40: Hoare triple {171831#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {171831#false} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {171831#false} assume !(~x~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {171831#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {171831#false} assume !(~y~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {171831#false} 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; {171831#false} is VALID [2022-04-28 10:20:05,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {172024#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {171831#false} is VALID [2022-04-28 10:20:05,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {172028#(< 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; {172024#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:20:05,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {172032#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {172028#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:20:05,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {172032#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {172032#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:20:05,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {172039#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172032#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:20:05,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {172043#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172039#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:20:05,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {172047#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172043#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:20:05,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {172051#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172047#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:20:05,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {172055#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172051#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:20:05,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {172059#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172055#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:20:05,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {172063#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172059#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:20:05,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {172067#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172063#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:20:05,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {172071#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172067#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:20:05,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {172075#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172071#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:20:05,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {172079#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172075#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:20:05,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {172083#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172079#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:20:05,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {172087#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172083#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:20:05,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {172091#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172087#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:20:05,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {172095#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172091#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:20:05,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {172099#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172095#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:20:05,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {172103#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172099#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:20:05,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {172107#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172103#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:20:05,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {172111#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172107#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:20:05,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {172115#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172111#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:20:05,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {172119#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172115#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:20:05,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {172123#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172119#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:20:05,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {172127#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172123#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:20:05,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {172131#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172127#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:20:05,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {172135#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172131#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:20:05,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {171830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172135#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:20:05,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {171830#true} call #t~ret15 := main(); {171830#true} is VALID [2022-04-28 10:20:05,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171830#true} {171830#true} #83#return; {171830#true} is VALID [2022-04-28 10:20:05,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {171830#true} assume true; {171830#true} is VALID [2022-04-28 10:20:05,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {171830#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); {171830#true} is VALID [2022-04-28 10:20:05,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {171830#true} call ULTIMATE.init(); {171830#true} is VALID [2022-04-28 10:20:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:20:05,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888365983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:05,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:05,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 10:20:05,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936880966] [2022-04-28 10:20:05,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936880966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:05,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:20:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691992785] [2022-04-28 10:20:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 44 [2022-04-28 10:20:05,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:05,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 10:20:05,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:05,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:20:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:20:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=2741, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:20:05,743 INFO L87 Difference]: Start difference. First operand 504 states and 645 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 10:20:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:33,445 INFO L93 Difference]: Finished difference Result 1168 states and 1646 transitions. [2022-04-28 10:20:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:20:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 44 [2022-04-28 10:20:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 10:20:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 322 transitions. [2022-04-28 10:20:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 10:20:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 322 transitions. [2022-04-28 10:20:33,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 322 transitions. [2022-04-28 10:20:33,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:33,763 INFO L225 Difference]: With dead ends: 1168 [2022-04-28 10:20:33,763 INFO L226 Difference]: Without dead ends: 1137 [2022-04-28 10:20:33,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1681, Invalid=6151, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 10:20:33,764 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 239 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7130 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 7130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:33,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 284 Invalid, 7306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 7130 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 10:20:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-04-28 10:20:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 522. [2022-04-28 10:20:36,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:36,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1137 states. Second operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 10:20:36,791 INFO L74 IsIncluded]: Start isIncluded. First operand 1137 states. Second operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 10:20:36,791 INFO L87 Difference]: Start difference. First operand 1137 states. Second operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 10:20:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:36,826 INFO L93 Difference]: Finished difference Result 1137 states and 1429 transitions. [2022-04-28 10:20:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1429 transitions. [2022-04-28 10:20:36,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:36,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:36,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 1137 states. [2022-04-28 10:20:36,827 INFO L87 Difference]: Start difference. First operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 1137 states. [2022-04-28 10:20:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:36,860 INFO L93 Difference]: Finished difference Result 1137 states and 1429 transitions. [2022-04-28 10:20:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1429 transitions. [2022-04-28 10:20:36,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:36,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:36,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:36,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 517 states have (on average 1.2901353965183753) internal successors, (667), 517 states have internal predecessors, (667), 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 10:20:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 671 transitions. [2022-04-28 10:20:36,873 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 671 transitions. Word has length 44 [2022-04-28 10:20:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:36,873 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 671 transitions. [2022-04-28 10:20:36,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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 10:20:36,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 671 transitions.